./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/logname-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/logname-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a1d3b316d503bafd24919c67f5c3ea44c9db1f709a53665a9b83874ae0ba729b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 17:59:35,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 17:59:35,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 17:59:35,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 17:59:35,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 17:59:35,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 17:59:35,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 17:59:35,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 17:59:35,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 17:59:35,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 17:59:35,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 17:59:35,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 17:59:35,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 17:59:35,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 17:59:35,223 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 17:59:35,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 17:59:35,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 17:59:35,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:59:35,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 17:59:35,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 17:59:35,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 17:59:35,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 17:59:35,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 17:59:35,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1d3b316d503bafd24919c67f5c3ea44c9db1f709a53665a9b83874ae0ba729b [2025-02-06 17:59:35,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 17:59:35,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 17:59:35,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 17:59:35,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 17:59:35,478 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 17:59:35,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/logname-2.i [2025-02-06 17:59:36,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5791b403/eced9607140940dea0c4eefab1b4ca63/FLAG4e1018000 [2025-02-06 17:59:36,983 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 17:59:36,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-2.i [2025-02-06 17:59:37,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5791b403/eced9607140940dea0c4eefab1b4ca63/FLAG4e1018000 [2025-02-06 17:59:37,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5791b403/eced9607140940dea0c4eefab1b4ca63 [2025-02-06 17:59:37,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 17:59:37,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 17:59:37,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 17:59:37,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 17:59:37,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 17:59:37,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:59:37" (1/1) ... [2025-02-06 17:59:37,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eec5165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:37, skipping insertion in model container [2025-02-06 17:59:37,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:59:37" (1/1) ... [2025-02-06 17:59:37,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 17:59:37,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:59:38,030 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 17:59:38,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:59:38,221 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 17:59:38,228 INFO L204 MainTranslator]: Completed translation [2025-02-06 17:59:38,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38 WrapperNode [2025-02-06 17:59:38,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 17:59:38,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 17:59:38,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 17:59:38,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 17:59:38,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,319 INFO L138 Inliner]: procedures = 594, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 815 [2025-02-06 17:59:38,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 17:59:38,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 17:59:38,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 17:59:38,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 17:59:38,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,341 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 17:59:38,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 17:59:38,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 17:59:38,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 17:59:38,385 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 17:59:38,386 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (1/1) ... [2025-02-06 17:59:38,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:59:38,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:38,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 17:59:38,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 17:59:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 17:59:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 17:59:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 17:59:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 17:59:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 17:59:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 17:59:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 17:59:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 17:59:38,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 17:59:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 17:59:38,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 17:59:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 17:59:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 17:59:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 17:59:38,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 17:59:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 17:59:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 17:59:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-02-06 17:59:38,433 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-02-06 17:59:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 17:59:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 17:59:38,637 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 17:59:38,639 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 17:59:39,202 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc getlogin_r_~ret~0#1; [2025-02-06 17:59:39,202 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc __main_~return_value_fflush_all$1~0#1; [2025-02-06 17:59:39,290 INFO L? ?]: Removed 237 outVars from TransFormulas that were not future-live. [2025-02-06 17:59:39,290 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 17:59:39,319 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 17:59:39,319 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 17:59:39,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:59:39 BoogieIcfgContainer [2025-02-06 17:59:39,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 17:59:39,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 17:59:39,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 17:59:39,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 17:59:39,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:59:37" (1/3) ... [2025-02-06 17:59:39,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebe5956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:59:39, skipping insertion in model container [2025-02-06 17:59:39,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:38" (2/3) ... [2025-02-06 17:59:39,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebe5956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:59:39, skipping insertion in model container [2025-02-06 17:59:39,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:59:39" (3/3) ... [2025-02-06 17:59:39,327 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-2.i [2025-02-06 17:59:39,338 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 17:59:39,339 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-2.i that has 4 procedures, 177 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-02-06 17:59:39,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 17:59:39,403 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;@47a383b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 17:59:39,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-06 17:59:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 121 states have (on average 1.6363636363636365) internal successors, (198), 163 states have internal predecessors, (198), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 17:59:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 17:59:39,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:39,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 17:59:39,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash 7910463, now seen corresponding path program 1 times [2025-02-06 17:59:39,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:39,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210936651] [2025-02-06 17:59:39,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:39,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 17:59:39,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 17:59:39,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:39,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:59:40,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:40,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210936651] [2025-02-06 17:59:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210936651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:40,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818037770] [2025-02-06 17:59:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:40,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:40,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:40,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:40,037 INFO L87 Difference]: Start difference. First operand has 177 states, 121 states have (on average 1.6363636363636365) internal successors, (198), 163 states have internal predecessors, (198), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:40,098 INFO L93 Difference]: Finished difference Result 240 states and 303 transitions. [2025-02-06 17:59:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 17:59:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:40,104 INFO L225 Difference]: With dead ends: 240 [2025-02-06 17:59:40,105 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 17:59:40,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:40,111 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:40,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 17:59:40,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-06 17:59:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 60 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2025-02-06 17:59:40,136 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 4 [2025-02-06 17:59:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:40,136 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2025-02-06 17:59:40,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2025-02-06 17:59:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 17:59:40,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:40,137 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 17:59:40,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 17:59:40,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:40,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash -562408258, now seen corresponding path program 1 times [2025-02-06 17:59:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:40,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907146527] [2025-02-06 17:59:40,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:40,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:40,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 17:59:40,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 17:59:40,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:40,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:59:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907146527] [2025-02-06 17:59:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907146527] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469383456] [2025-02-06 17:59:40,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:40,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:40,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:40,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:40,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 17:59:40,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 17:59:40,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 17:59:40,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:40,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:40,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:59:40,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:59:40,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:40,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469383456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:40,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:59:40,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 17:59:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316721526] [2025-02-06 17:59:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:40,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:59:40,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:40,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:59:40,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:40,587 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:40,611 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-02-06 17:59:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:59:40,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 17:59:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:40,613 INFO L225 Difference]: With dead ends: 67 [2025-02-06 17:59:40,613 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 17:59:40,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:40,613 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:40,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 205 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 17:59:40,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-06 17:59:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.446808510638298) internal successors, (68), 59 states have internal predecessors, (68), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2025-02-06 17:59:40,622 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 7 [2025-02-06 17:59:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:40,623 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2025-02-06 17:59:40,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2025-02-06 17:59:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 17:59:40,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:40,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 17:59:40,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 17:59:40,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:40,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:40,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash -254786623, now seen corresponding path program 1 times [2025-02-06 17:59:40,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:40,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986377664] [2025-02-06 17:59:40,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:40,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 17:59:40,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 17:59:40,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:40,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 17:59:41,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:41,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986377664] [2025-02-06 17:59:41,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986377664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:41,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283427287] [2025-02-06 17:59:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:41,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:41,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:41,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:41,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:41,198 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:41,209 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-02-06 17:59:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:41,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 17:59:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:41,210 INFO L225 Difference]: With dead ends: 66 [2025-02-06 17:59:41,210 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 17:59:41,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:41,211 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:41,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 17:59:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-02-06 17:59:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 56 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-02-06 17:59:41,215 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 8 [2025-02-06 17:59:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:41,216 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-02-06 17:59:41,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-02-06 17:59:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 17:59:41,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:41,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:41,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 17:59:41,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:41,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash -666408110, now seen corresponding path program 1 times [2025-02-06 17:59:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:41,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629458492] [2025-02-06 17:59:41,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:41,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:59:41,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:59:41,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:41,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:59:41,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:41,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629458492] [2025-02-06 17:59:41,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629458492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:41,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930873059] [2025-02-06 17:59:41,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:41,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:41,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:41,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:41,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 17:59:41,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:59:41,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:59:41,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:41,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:41,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 17:59:41,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 17:59:41,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:41,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930873059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:41,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:59:41,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 17:59:41,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300870625] [2025-02-06 17:59:41,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:41,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:41,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:41,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:41,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:41,654 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:41,675 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-02-06 17:59:41,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:41,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 17:59:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:41,676 INFO L225 Difference]: With dead ends: 63 [2025-02-06 17:59:41,676 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 17:59:41,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:41,677 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 48 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:41,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 78 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 17:59:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-06 17:59:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.4) internal successors, (63), 54 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-02-06 17:59:41,688 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 12 [2025-02-06 17:59:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:41,689 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-06 17:59:41,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-02-06 17:59:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 17:59:41,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:41,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:41,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 17:59:41,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:41,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 816185255, now seen corresponding path program 1 times [2025-02-06 17:59:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:41,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048700687] [2025-02-06 17:59:41,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:41,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:59:41,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:59:41,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:41,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:59:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048700687] [2025-02-06 17:59:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048700687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737379877] [2025-02-06 17:59:42,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:42,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:42,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:42,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 17:59:42,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:59:42,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:59:42,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:42,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:42,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:59:42,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:59:42,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:59:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:59:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737379877] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:59:42,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:59:42,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 17:59:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342389583] [2025-02-06 17:59:42,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:59:42,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:59:42,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:42,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:59:42,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:59:42,363 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:59:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:42,398 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2025-02-06 17:59:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:59:42,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-02-06 17:59:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:42,399 INFO L225 Difference]: With dead ends: 125 [2025-02-06 17:59:42,399 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 17:59:42,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:59:42,400 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:42,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 266 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 17:59:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-06 17:59:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 63 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2025-02-06 17:59:42,412 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 13 [2025-02-06 17:59:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:42,412 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2025-02-06 17:59:42,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:59:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2025-02-06 17:59:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 17:59:42,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:42,413 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:42,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 17:59:42,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:42,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:42,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash 140560808, now seen corresponding path program 2 times [2025-02-06 17:59:42,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:42,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296536673] [2025-02-06 17:59:42,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:59:42,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:42,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 17:59:42,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 17:59:42,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 17:59:42,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 17:59:42,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:42,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296536673] [2025-02-06 17:59:42,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296536673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:42,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:42,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 17:59:42,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583202036] [2025-02-06 17:59:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:42,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:59:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:42,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:59:42,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:42,953 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:42,996 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-02-06 17:59:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:59:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 17:59:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:42,997 INFO L225 Difference]: With dead ends: 70 [2025-02-06 17:59:42,997 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 17:59:42,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:42,998 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:42,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 177 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 17:59:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 17:59:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 61 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-02-06 17:59:43,010 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 22 [2025-02-06 17:59:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:43,010 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-02-06 17:59:43,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-02-06 17:59:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 17:59:43,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:43,011 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:43,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 17:59:43,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:43,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:43,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1523240396, now seen corresponding path program 1 times [2025-02-06 17:59:43,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:43,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837619152] [2025-02-06 17:59:43,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:43,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:43,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 17:59:43,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 17:59:43,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:43,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 17:59:43,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:43,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837619152] [2025-02-06 17:59:43,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837619152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:43,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:43,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385624441] [2025-02-06 17:59:43,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:43,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:43,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:43,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:43,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:43,220 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:43,238 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2025-02-06 17:59:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:43,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-06 17:59:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:43,239 INFO L225 Difference]: With dead ends: 119 [2025-02-06 17:59:43,239 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 17:59:43,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:43,240 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:43,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 17:59:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-06 17:59:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.280701754385965) internal successors, (73), 64 states have internal predecessors, (73), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2025-02-06 17:59:43,245 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 27 [2025-02-06 17:59:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:43,245 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2025-02-06 17:59:43,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2025-02-06 17:59:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 17:59:43,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:43,246 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 17:59:43,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:43,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:43,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1769638399, now seen corresponding path program 1 times [2025-02-06 17:59:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:43,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264260177] [2025-02-06 17:59:43,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:43,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:59:43,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:59:43,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:43,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 17:59:43,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:43,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264260177] [2025-02-06 17:59:43,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264260177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:43,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797670846] [2025-02-06 17:59:43,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:43,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:43,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:43,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:43,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 17:59:43,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:59:43,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:59:43,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:43,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:43,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 17:59:43,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 17:59:43,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:59:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 17:59:43,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797670846] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:59:43,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:59:43,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 17:59:43,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769964706] [2025-02-06 17:59:43,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:59:43,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 17:59:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:43,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 17:59:43,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 17:59:43,925 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 17:59:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:43,985 INFO L93 Difference]: Finished difference Result 144 states and 172 transitions. [2025-02-06 17:59:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 17:59:43,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-02-06 17:59:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:43,986 INFO L225 Difference]: With dead ends: 144 [2025-02-06 17:59:43,986 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 17:59:43,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 17:59:43,987 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:43,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:59:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 17:59:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-06 17:59:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.2) internal successors, (90), 81 states have internal predecessors, (90), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2025-02-06 17:59:43,991 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 30 [2025-02-06 17:59:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:43,991 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2025-02-06 17:59:43,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 17:59:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2025-02-06 17:59:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 17:59:43,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:43,992 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:44,003 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-06 17:59:44,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 17:59:44,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:44,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1053632577, now seen corresponding path program 1 times [2025-02-06 17:59:44,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34327283] [2025-02-06 17:59:44,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:44,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 17:59:44,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 17:59:44,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:44,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 17:59:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34327283] [2025-02-06 17:59:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34327283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101829821] [2025-02-06 17:59:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:44,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:44,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:44,352 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:44,376 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-02-06 17:59:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-06 17:59:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:44,377 INFO L225 Difference]: With dead ends: 100 [2025-02-06 17:59:44,377 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 17:59:44,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:44,378 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:44,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 122 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 17:59:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-02-06 17:59:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 90 states have internal predecessors, (102), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-02-06 17:59:44,389 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 48 [2025-02-06 17:59:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:44,389 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-02-06 17:59:44,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-02-06 17:59:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 17:59:44,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:44,390 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 17:59:44,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:44,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1697123346, now seen corresponding path program 1 times [2025-02-06 17:59:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:44,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009237655] [2025-02-06 17:59:44,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:44,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 17:59:44,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 17:59:44,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:44,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 17:59:44,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:44,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009237655] [2025-02-06 17:59:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009237655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:44,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457341677] [2025-02-06 17:59:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:44,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:44,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:44,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:44,560 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:44,576 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2025-02-06 17:59:44,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:44,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-06 17:59:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:44,577 INFO L225 Difference]: With dead ends: 97 [2025-02-06 17:59:44,577 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 17:59:44,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:44,578 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:44,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 17:59:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-02-06 17:59:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.2) internal successors, (96), 85 states have internal predecessors, (96), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2025-02-06 17:59:44,587 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 49 [2025-02-06 17:59:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:44,587 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2025-02-06 17:59:44,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2025-02-06 17:59:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 17:59:44,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:44,590 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:44,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 17:59:44,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:44,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:44,592 INFO L85 PathProgramCache]: Analyzing trace with hash 609148149, now seen corresponding path program 1 times [2025-02-06 17:59:44,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:44,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067068520] [2025-02-06 17:59:44,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:44,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:44,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:59:44,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:59:44,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:44,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 17:59:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067068520] [2025-02-06 17:59:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067068520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:44,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:44,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:44,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84851220] [2025-02-06 17:59:44,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:44,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:44,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:44,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:44,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:44,762 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-06 17:59:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:44,784 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2025-02-06 17:59:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:44,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 55 [2025-02-06 17:59:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:44,785 INFO L225 Difference]: With dead ends: 97 [2025-02-06 17:59:44,786 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 17:59:44,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:44,787 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:44,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 17:59:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 17:59:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 88 states have internal predecessors, (100), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-02-06 17:59:44,794 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 55 [2025-02-06 17:59:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:44,795 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-02-06 17:59:44,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-06 17:59:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-02-06 17:59:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 17:59:44,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:44,796 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:44,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 17:59:44,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:44,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:44,798 INFO L85 PathProgramCache]: Analyzing trace with hash -570724060, now seen corresponding path program 1 times [2025-02-06 17:59:44,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:44,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758469920] [2025-02-06 17:59:44,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:44,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:59:44,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:59:44,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:44,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 17:59:44,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:44,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758469920] [2025-02-06 17:59:44,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758469920] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:44,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785948780] [2025-02-06 17:59:44,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:44,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:44,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:44,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:44,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 17:59:45,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:59:45,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:59:45,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:45,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:45,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:59:45,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 17:59:45,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:59:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 17:59:45,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785948780] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:59:45,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:59:45,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 17:59:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920372495] [2025-02-06 17:59:45,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:59:45,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:59:45,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:45,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:59:45,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:59:45,336 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:45,360 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2025-02-06 17:59:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:59:45,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-06 17:59:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:45,364 INFO L225 Difference]: With dead ends: 165 [2025-02-06 17:59:45,364 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 17:59:45,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:59:45,365 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:45,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 125 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 17:59:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-06 17:59:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 106 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2025-02-06 17:59:45,370 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 55 [2025-02-06 17:59:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:45,370 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2025-02-06 17:59:45,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2025-02-06 17:59:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 17:59:45,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:45,371 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:45,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 17:59:45,571 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-06 17:59:45,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:45,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash 895829342, now seen corresponding path program 1 times [2025-02-06 17:59:45,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:45,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527022708] [2025-02-06 17:59:45,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:45,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:45,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 17:59:45,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 17:59:45,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:45,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 17:59:45,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:45,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527022708] [2025-02-06 17:59:45,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527022708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:45,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114966493] [2025-02-06 17:59:45,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:45,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:45,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:45,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:45,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 17:59:45,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 17:59:45,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 17:59:45,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:45,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:45,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:59:45,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 17:59:46,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:46,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114966493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:46,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:59:46,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 17:59:46,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833737466] [2025-02-06 17:59:46,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:46,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:59:46,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:46,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:59:46,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:46,014 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 17:59:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:46,033 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2025-02-06 17:59:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:59:46,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 58 [2025-02-06 17:59:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:46,034 INFO L225 Difference]: With dead ends: 113 [2025-02-06 17:59:46,034 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 17:59:46,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:59:46,035 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:46,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 17:59:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 17:59:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 105 states have internal predecessors, (117), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2025-02-06 17:59:46,039 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 58 [2025-02-06 17:59:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:46,039 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2025-02-06 17:59:46,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 17:59:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2025-02-06 17:59:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 17:59:46,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:46,040 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:46,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 17:59:46,244 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-06 17:59:46,244 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:46,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1609721326, now seen corresponding path program 1 times [2025-02-06 17:59:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572857024] [2025-02-06 17:59:46,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:46,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 17:59:46,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 17:59:46,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:46,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 17:59:46,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:46,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572857024] [2025-02-06 17:59:46,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572857024] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:46,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605868782] [2025-02-06 17:59:46,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:46,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:46,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:46,565 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:46,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 17:59:46,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 17:59:46,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 17:59:46,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:46,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:46,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 17:59:46,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 17:59:46,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:46,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605868782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:46,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:59:46,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-06 17:59:46,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047000300] [2025-02-06 17:59:46,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:46,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 17:59:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:46,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 17:59:46,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 17:59:46,899 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:59:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:46,939 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2025-02-06 17:59:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:59:46,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2025-02-06 17:59:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:46,940 INFO L225 Difference]: With dead ends: 130 [2025-02-06 17:59:46,941 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 17:59:46,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 17:59:46,941 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:46,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 212 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 17:59:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 17:59:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 1.1485148514851484) internal successors, (116), 105 states have internal predecessors, (116), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2025-02-06 17:59:46,945 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 60 [2025-02-06 17:59:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:46,946 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2025-02-06 17:59:46,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:59:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2025-02-06 17:59:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 17:59:46,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:46,946 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:46,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 17:59:47,147 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-06 17:59:47,147 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:47,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2000905975, now seen corresponding path program 1 times [2025-02-06 17:59:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:47,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534132409] [2025-02-06 17:59:47,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:47,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:47,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 17:59:47,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 17:59:47,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:47,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 17:59:47,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534132409] [2025-02-06 17:59:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534132409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566632693] [2025-02-06 17:59:47,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:47,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:47,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:47,300 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:47,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 17:59:47,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 17:59:47,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 17:59:47,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:47,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:47,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:59:47,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 17:59:47,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:59:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 17:59:47,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566632693] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:59:47,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:59:47,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 17:59:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236927074] [2025-02-06 17:59:47,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:59:47,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:59:47,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:47,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:59:47,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:59:47,639 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-06 17:59:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:47,667 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2025-02-06 17:59:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:59:47,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2025-02-06 17:59:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:47,668 INFO L225 Difference]: With dead ends: 122 [2025-02-06 17:59:47,669 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 17:59:47,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:59:47,669 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:47,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 17:59:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-02-06 17:59:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 114 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2025-02-06 17:59:47,674 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 59 [2025-02-06 17:59:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:47,674 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2025-02-06 17:59:47,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-06 17:59:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2025-02-06 17:59:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 17:59:47,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:47,675 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 1, 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-06 17:59:47,685 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-06 17:59:47,875 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-06 17:59:47,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:47,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1251573070, now seen corresponding path program 1 times [2025-02-06 17:59:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464616213] [2025-02-06 17:59:47,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:47,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 17:59:47,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 17:59:47,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:47,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-02-06 17:59:48,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:48,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464616213] [2025-02-06 17:59:48,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464616213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:48,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390754560] [2025-02-06 17:59:48,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:48,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:48,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:48,159 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-06 17:59:48,161 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-06 17:59:48,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 17:59:48,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 17:59:48,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:48,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:48,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 17:59:48,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-02-06 17:59:48,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:48,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390754560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:48,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:59:48,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2025-02-06 17:59:48,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855445463] [2025-02-06 17:59:48,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:48,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:59:48,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:48,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:59:48,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 17:59:48,538 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 17:59:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:48,586 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2025-02-06 17:59:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 17:59:48,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2025-02-06 17:59:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:48,587 INFO L225 Difference]: With dead ends: 128 [2025-02-06 17:59:48,587 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 17:59:48,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 17:59:48,588 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:48,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 17:59:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-02-06 17:59:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 116 states have internal predecessors, (130), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2025-02-06 17:59:48,593 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 64 [2025-02-06 17:59:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:48,593 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2025-02-06 17:59:48,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 17:59:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2025-02-06 17:59:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 17:59:48,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:48,594 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:48,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 17:59:48,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:48,795 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:48,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:48,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1211508955, now seen corresponding path program 1 times [2025-02-06 17:59:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:48,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570239441] [2025-02-06 17:59:48,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:48,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 17:59:48,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 17:59:48,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:48,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 17:59:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570239441] [2025-02-06 17:59:49,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570239441] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100575817] [2025-02-06 17:59:49,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:49,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:49,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:49,116 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:49,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 17:59:49,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 17:59:49,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 17:59:49,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:49,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:49,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 17:59:49,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 17:59:49,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:49,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100575817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:49,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:59:49,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-06 17:59:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134648338] [2025-02-06 17:59:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:49,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 17:59:49,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:49,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 17:59:49,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 17:59:49,526 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:59:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:49,593 INFO L93 Difference]: Finished difference Result 174 states and 200 transitions. [2025-02-06 17:59:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:59:49,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 63 [2025-02-06 17:59:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:49,594 INFO L225 Difference]: With dead ends: 174 [2025-02-06 17:59:49,594 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 17:59:49,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 17:59:49,596 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 54 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:49,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 193 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:59:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 17:59:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-02-06 17:59:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 112 states have (on average 1.1517857142857142) internal successors, (129), 116 states have internal predecessors, (129), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2025-02-06 17:59:49,605 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 63 [2025-02-06 17:59:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:49,606 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2025-02-06 17:59:49,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:59:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2025-02-06 17:59:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 17:59:49,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:49,607 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:49,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 17:59:49,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 17:59:49,811 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:49,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1352391596, now seen corresponding path program 2 times [2025-02-06 17:59:49,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:49,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157453802] [2025-02-06 17:59:49,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:59:49,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:49,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 17:59:49,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 17:59:49,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 17:59:49,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-06 17:59:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:59:50,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157453802] [2025-02-06 17:59:50,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157453802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:59:50,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177166905] [2025-02-06 17:59:50,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:59:50,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:50,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:50,022 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:50,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 17:59:50,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 17:59:50,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 17:59:50,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 17:59:50,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:50,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 17:59:50,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 17:59:50,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:59:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 17:59:50,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177166905] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:59:50,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:59:50,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 17:59:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505016481] [2025-02-06 17:59:50,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:59:50,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 17:59:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:59:50,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 17:59:50,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 17:59:50,697 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:50,976 INFO L93 Difference]: Finished difference Result 229 states and 269 transitions. [2025-02-06 17:59:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 17:59:50,976 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-02-06 17:59:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:50,977 INFO L225 Difference]: With dead ends: 229 [2025-02-06 17:59:50,977 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 17:59:50,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 17:59:50,978 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:50,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 388 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:59:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 17:59:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-06 17:59:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 148 states have (on average 1.1081081081081081) internal successors, (164), 151 states have internal predecessors, (164), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2025-02-06 17:59:50,985 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 73 [2025-02-06 17:59:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:50,985 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2025-02-06 17:59:50,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:59:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2025-02-06 17:59:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 17:59:50,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:50,986 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:50,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 17:59:51,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 17:59:51,187 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:51,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1791219955, now seen corresponding path program 1 times [2025-02-06 17:59:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:59:51,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612117960] [2025-02-06 17:59:51,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:59:51,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 17:59:51,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 17:59:51,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:51,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 17:59:51,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 17:59:51,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 17:59:51,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 17:59:51,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:51,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 17:59:51,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 17:59:51,607 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 17:59:51,607 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (41 of 42 remaining) [2025-02-06 17:59:51,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 42 remaining) [2025-02-06 17:59:51,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 42 remaining) [2025-02-06 17:59:51,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 42 remaining) [2025-02-06 17:59:51,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 42 remaining) [2025-02-06 17:59:51,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 42 remaining) [2025-02-06 17:59:51,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 17:59:51,616 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:59:51,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 17:59:51,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:59:51 BoogieIcfgContainer [2025-02-06 17:59:51,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 17:59:51,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 17:59:51,703 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 17:59:51,703 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 17:59:51,704 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:59:39" (3/4) ... [2025-02-06 17:59:51,705 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 17:59:51,706 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 17:59:51,706 INFO L158 Benchmark]: Toolchain (without parser) took 14456.49ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 118.8MB in the beginning and 222.0MB in the end (delta: -103.2MB). Peak memory consumption was 224.6MB. Max. memory is 16.1GB. [2025-02-06 17:59:51,707 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 17:59:51,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 977.77ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 36.3MB in the end (delta: 82.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 17:59:51,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.84ms. Allocated memory is still 167.8MB. Free memory was 36.3MB in the beginning and 112.2MB in the end (delta: -75.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2025-02-06 17:59:51,708 INFO L158 Benchmark]: Boogie Preprocessor took 64.50ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 104.6MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 17:59:51,708 INFO L158 Benchmark]: IcfgBuilder took 934.18ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 104.7MB in the end (delta: -87.2kB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2025-02-06 17:59:51,708 INFO L158 Benchmark]: TraceAbstraction took 12381.34ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 104.7MB in the beginning and 222.1MB in the end (delta: -117.4MB). Peak memory consumption was 205.3MB. Max. memory is 16.1GB. [2025-02-06 17:59:51,708 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 494.9MB. Free memory was 222.1MB in the beginning and 222.0MB in the end (delta: 41.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 17:59:51,709 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 977.77ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 36.3MB in the end (delta: 82.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.84ms. Allocated memory is still 167.8MB. Free memory was 36.3MB in the beginning and 112.2MB in the end (delta: -75.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.50ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 104.6MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 934.18ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 104.7MB in the end (delta: -87.2kB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12381.34ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 104.7MB in the beginning and 222.1MB in the end (delta: -117.4MB). Peak memory consumption was 205.3MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 494.9MB. Free memory was 222.1MB in the beginning and 222.0MB in the end (delta: 41.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 2339]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 2339. Possible FailurePath: [L2229] static const char *applet_name; [L2230] static signed int bb_errno_location; [L2231] static signed int * const bb_errno = &bb_errno_location; [L2232] static struct __jmp_buf_tag die_jmp[1l]; [L2233] static signed int die_sleep; [L2234] static signed char logmode = (signed char)1; [L2235] static const char *msg_eol = "\n"; [L2236] static unsigned char xfunc_error_retval = (unsigned char)1; [L2426] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2489] char *a = malloc(11); [L2490] a[10] = 0 [L2491] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=2, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=3, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=4, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=5, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=6, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=7, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=8, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND TRUE i<10 [L2492] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=9, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=10, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L2491] COND FALSE !(i<10) [L2493] applet_name = a [L2494] bb_errno_location = __VERIFIER_nondet_int() [L2495] optind = 1 [L2496] int argc = __VERIFIER_nondet_int(); [L2497] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2497] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2498] EXPR argc+1 [L2498] char **argv=malloc((argc+1)*sizeof(char*)); [L2499] EXPR argc+1 [L2499] char **mem_track=malloc((argc+1)*sizeof(char*)); [L2500] argv[argc]=0 [L2501] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-13:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, mem_track={-14:0}, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2501] COND TRUE i 0 && size < bufsize) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2414] RET assume_abort_if_not(size > 0 && size < bufsize) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, buf={331:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, size=1, xfunc_error_retval=1] [L2415] int i = 0; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, buf={331:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, i=0, logmode=1, msg_eol={3:0}, optind=1, size=1, xfunc_error_retval=1] [L2415] COND TRUE i < size [L2416] buf[i] = __VERIFIER_nondet_char() [L2415] ++i VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, buf={331:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, i=1, logmode=1, msg_eol={3:0}, optind=1, size=1, xfunc_error_retval=1] [L2415] COND FALSE !(i < size) [L2418] buf[size] = '\0' [L2419] return 0; VAL [\result=0, applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, bufsize=64, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2369] RET, EXPR getlogin_r(buf, sizeof(char [64l]) ) [L2369] return_value_getlogin_r$2=getlogin_r(buf, sizeof(char [64l]) ) [L2370] COND TRUE return_value_getlogin_r$2 == 0 [L2373] signed int return_value_fflush_all$1; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2374] CALL fflush_all() VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2338] signed int return_value_fflush$1; VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L2339] fflush((struct _IO_FILE *)((void *)0)) VAL [applet_name={-1:0}, bb_errno={7:0}, bb_errno_location={7:0}, die_sleep=0, dummy_utmp={8:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] - UnprovableResult [Line: 2510]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2510]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2355]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2355]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2298]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2298]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2325]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2325]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2322]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2322]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2318]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2315]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2315]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2309]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2308]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2306]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2306]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2290]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 932]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - UnprovableResult [Line: 2415]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2415]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2501]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2501]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2506]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2506]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2498]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2498]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2491]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 2491]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 177 locations, 42 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 3404 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2273 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 1131 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 789 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=0, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1298 NumberOfCodeBlocks, 1286 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1397 ConstructedInterpolants, 0 QuantifiedInterpolants, 1927 SizeOfPredicates, 1 NumberOfNonLiveVariables, 12732 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 34 InterpolantComputations, 13 PerfectInterpolantSequences, 3269/3450 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 17:59:51,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/logname-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a1d3b316d503bafd24919c67f5c3ea44c9db1f709a53665a9b83874ae0ba729b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 17:59:53,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 17:59:53,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-02-06 17:59:53,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 17:59:53,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 17:59:53,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-02-06 17:59:53,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 17:59:53,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 17:59:53,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 17:59:53,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 17:59:53,707 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 17:59:53,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 17:59:53,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 17:59:53,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 17:59:53,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 17:59:53,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 17:59:53,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 17:59:53,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 17:59:53,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 17:59:53,710 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 17:59:53,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 17:59:53,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 17:59:53,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 17:59:53,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 17:59:53,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:59:53,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 17:59:53,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 17:59:53,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 17:59:53,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 17:59:53,711 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 17:59:53,711 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 17:59:53,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 17:59:53,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 17:59:53,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 17:59:53,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 17:59:53,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1d3b316d503bafd24919c67f5c3ea44c9db1f709a53665a9b83874ae0ba729b [2025-02-06 17:59:53,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 17:59:53,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 17:59:53,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 17:59:53,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 17:59:53,984 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 17:59:53,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/logname-2.i [2025-02-06 17:59:55,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e79a4e2c3/27a342d7d69648b78905721f35d6c785/FLAGd47403b70 [2025-02-06 17:59:55,555 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 17:59:55,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-2.i [2025-02-06 17:59:55,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e79a4e2c3/27a342d7d69648b78905721f35d6c785/FLAGd47403b70 [2025-02-06 17:59:55,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e79a4e2c3/27a342d7d69648b78905721f35d6c785 [2025-02-06 17:59:55,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 17:59:55,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 17:59:55,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 17:59:55,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 17:59:55,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 17:59:55,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:59:55" (1/1) ... [2025-02-06 17:59:55,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d11f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:55, skipping insertion in model container [2025-02-06 17:59:55,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:59:55" (1/1) ... [2025-02-06 17:59:55,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 17:59:56,329 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,331 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,333 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,336 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,339 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,339 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,340 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,341 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,342 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,346 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,347 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,354 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,355 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,358 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,370 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,382 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 17:59:56,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:59:56,421 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 17:59:56,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:59:56,697 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 17:59:56,703 INFO L204 MainTranslator]: Completed translation [2025-02-06 17:59:56,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56 WrapperNode [2025-02-06 17:59:56,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 17:59:56,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 17:59:56,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 17:59:56,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 17:59:56,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,786 INFO L138 Inliner]: procedures = 605, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 789 [2025-02-06 17:59:56,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 17:59:56,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 17:59:56,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 17:59:56,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 17:59:56,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,814 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 17:59:56,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 17:59:56,872 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 17:59:56,872 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 17:59:56,872 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 17:59:56,873 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (1/1) ... [2025-02-06 17:59:56,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:59:56,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:56,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 17:59:56,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 17:59:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 17:59:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-02-06 17:59:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-02-06 17:59:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-02-06 17:59:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 17:59:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 17:59:56,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 17:59:56,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-02-06 17:59:56,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-02-06 17:59:56,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-02-06 17:59:56,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 17:59:56,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 17:59:56,915 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 17:59:56,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-02-06 17:59:56,915 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-02-06 17:59:56,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-02-06 17:59:57,165 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 17:59:57,166 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 17:59:58,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc getlogin_r_~ret~0#1; [2025-02-06 17:59:58,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc __main_~return_value_fflush_all$1~0#1; [2025-02-06 17:59:58,087 INFO L? ?]: Removed 224 outVars from TransFormulas that were not future-live. [2025-02-06 17:59:58,087 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 17:59:58,098 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 17:59:58,098 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 17:59:58,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:59:58 BoogieIcfgContainer [2025-02-06 17:59:58,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 17:59:58,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 17:59:58,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 17:59:58,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 17:59:58,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:59:55" (1/3) ... [2025-02-06 17:59:58,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cccbec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:59:58, skipping insertion in model container [2025-02-06 17:59:58,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:59:56" (2/3) ... [2025-02-06 17:59:58,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cccbec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:59:58, skipping insertion in model container [2025-02-06 17:59:58,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:59:58" (3/3) ... [2025-02-06 17:59:58,112 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-2.i [2025-02-06 17:59:58,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 17:59:58,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-2.i that has 4 procedures, 174 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-02-06 17:59:58,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 17:59:58,200 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;@33ec561e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 17:59:58,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-06 17:59:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 118 states have (on average 1.6355932203389831) internal successors, (193), 160 states have internal predecessors, (193), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 17:59:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 17:59:58,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:58,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 17:59:58,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:58,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 7725759, now seen corresponding path program 1 times [2025-02-06 17:59:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 17:59:58,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440508408] [2025-02-06 17:59:58,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:58,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:58,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:58,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:58,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 17:59:58,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 17:59:58,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 17:59:58,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:58,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:58,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 17:59:58,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:59:58,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:58,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 17:59:58,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440508408] [2025-02-06 17:59:58,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440508408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:58,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:58,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 17:59:58,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122959045] [2025-02-06 17:59:58,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 17:59:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 17:59:58,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 17:59:58,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 17:59:58,952 INFO L87 Difference]: Start difference. First operand has 174 states, 118 states have (on average 1.6355932203389831) internal successors, (193), 160 states have internal predecessors, (193), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:58,968 INFO L93 Difference]: Finished difference Result 226 states and 290 transitions. [2025-02-06 17:59:58,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 17:59:58,970 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 17:59:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:58,974 INFO L225 Difference]: With dead ends: 226 [2025-02-06 17:59:58,975 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 17:59:58,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 17:59:58,979 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:58,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 17:59:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 17:59:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 51 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-02-06 17:59:59,007 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 4 [2025-02-06 17:59:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:59,007 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-02-06 17:59:59,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-02-06 17:59:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 17:59:59,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:59,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 17:59:59,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 17:59:59,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:59,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 17:59:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:59:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 239498714, now seen corresponding path program 1 times [2025-02-06 17:59:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 17:59:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449764008] [2025-02-06 17:59:59,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:59:59,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:59:59,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:59:59,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 17:59:59,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 17:59:59,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 17:59:59,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 17:59:59,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:59:59,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:59:59,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 17:59:59,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:59:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:59:59,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:59:59,848 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 17:59:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449764008] [2025-02-06 17:59:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449764008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:59:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:59:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:59:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820187090] [2025-02-06 17:59:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:59:59,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:59:59,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 17:59:59,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:59:59,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:59,852 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:59:59,881 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2025-02-06 17:59:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:59:59,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 17:59:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:59:59,882 INFO L225 Difference]: With dead ends: 114 [2025-02-06 17:59:59,883 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 17:59:59,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:59:59,884 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:59:59,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:59:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 17:59:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-06 17:59:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 54 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:59:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-02-06 17:59:59,893 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 5 [2025-02-06 17:59:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:59:59,893 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-06 17:59:59,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 17:59:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-02-06 17:59:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 17:59:59,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:59:59,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 17:59:59,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:00:00,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:00,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:00,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash 965697729, now seen corresponding path program 1 times [2025-02-06 18:00:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:00,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858758103] [2025-02-06 18:00:00,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:00,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:00,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:00,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:00,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:00:00,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:00:00,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:00:00,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:00,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:00,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:00:00,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:00:00,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:00:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:00:00,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858758103] [2025-02-06 18:00:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858758103] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:00:00,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 18:00:00,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-06 18:00:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453122231] [2025-02-06 18:00:00,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 18:00:00,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:00:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:00,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:00:00,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:00,915 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:00:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:00,991 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2025-02-06 18:00:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:00:00,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 18:00:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:00,993 INFO L225 Difference]: With dead ends: 117 [2025-02-06 18:00:00,993 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 18:00:00,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:00:00,994 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:00,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 18:00:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2025-02-06 18:00:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3125) internal successors, (63), 54 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-02-06 18:00:00,998 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 8 [2025-02-06 18:00:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:00,998 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-06 18:00:00,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:00:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-02-06 18:00:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 18:00:00,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:00,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:01,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:01,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:01,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:01,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash -693618950, now seen corresponding path program 1 times [2025-02-06 18:00:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552770418] [2025-02-06 18:00:01,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:01,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:01,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:01,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:01,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:00:01,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:00:01,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:00:01,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:01,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:01,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:00:01,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:00:01,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:00:01,827 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:01,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552770418] [2025-02-06 18:00:01,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552770418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:01,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:01,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:00:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287941087] [2025-02-06 18:00:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:01,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:00:01,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:01,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:00:01,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:00:01,829 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:02,315 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2025-02-06 18:00:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:00:02,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-06 18:00:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:02,316 INFO L225 Difference]: With dead ends: 61 [2025-02-06 18:00:02,317 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 18:00:02,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:00:02,317 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:02,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 168 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 18:00:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 18:00:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 18:00:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 52 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-02-06 18:00:02,325 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 16 [2025-02-06 18:00:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:02,328 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-02-06 18:00:02,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-02-06 18:00:02,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:00:02,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:02,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:02,356 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-06 18:00:02,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:02,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:02,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1443164528, now seen corresponding path program 1 times [2025-02-06 18:00:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:02,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1431161481] [2025-02-06 18:00:02,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:02,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:02,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:02,533 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:02,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:00:02,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:00:03,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:00:03,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:03,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:03,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:00:03,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:00:03,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:00:03,315 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431161481] [2025-02-06 18:00:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431161481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:00:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386214307] [2025-02-06 18:00:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:03,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:00:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:03,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:00:03,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:00:03,316 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:03,550 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2025-02-06 18:00:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:00:03,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 18:00:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:03,552 INFO L225 Difference]: With dead ends: 67 [2025-02-06 18:00:03,552 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 18:00:03,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:00:03,552 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:03,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:00:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 18:00:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-02-06 18:00:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 58 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-02-06 18:00:03,566 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 22 [2025-02-06 18:00:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:03,566 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-06 18:00:03,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-02-06 18:00:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:00:03,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:03,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:03,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:00:03,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:03,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:03,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1443159563, now seen corresponding path program 1 times [2025-02-06 18:00:03,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:03,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397300890] [2025-02-06 18:00:03,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:03,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:03,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:03,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:03,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:00:03,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:00:04,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:00:04,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:04,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:04,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:00:04,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:00:04,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:00:04,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397300890] [2025-02-06 18:00:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397300890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:00:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703790248] [2025-02-06 18:00:04,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:04,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:00:04,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:04,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:00:04,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:00:04,477 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:04,535 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2025-02-06 18:00:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:00:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 18:00:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:04,536 INFO L225 Difference]: With dead ends: 118 [2025-02-06 18:00:04,536 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 18:00:04,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:00:04,537 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:04,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 18:00:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-06 18:00:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 64 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2025-02-06 18:00:04,542 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 22 [2025-02-06 18:00:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:04,543 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-02-06 18:00:04,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2025-02-06 18:00:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 18:00:04,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:04,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:04,578 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-06 18:00:04,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:04,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash -543736650, now seen corresponding path program 1 times [2025-02-06 18:00:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:04,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745963631] [2025-02-06 18:00:04,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:04,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:04,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:04,753 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:04,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:00:04,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 18:00:05,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 18:00:05,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:05,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:05,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:00:05,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:00:05,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:00:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:00:05,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:05,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745963631] [2025-02-06 18:00:05,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745963631] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:00:05,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 18:00:05,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-06 18:00:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119066910] [2025-02-06 18:00:05,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 18:00:05,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:00:05,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:05,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:00:05,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:05,646 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:05,749 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2025-02-06 18:00:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:00:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-06 18:00:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:05,750 INFO L225 Difference]: With dead ends: 128 [2025-02-06 18:00:05,750 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 18:00:05,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:00:05,751 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:05,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 18:00:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-02-06 18:00:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 65 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2025-02-06 18:00:05,755 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 25 [2025-02-06 18:00:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:05,756 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2025-02-06 18:00:05,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2025-02-06 18:00:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 18:00:05,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:05,756 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] [2025-02-06 18:00:05,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:05,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:05,961 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:05,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:05,962 INFO L85 PathProgramCache]: Analyzing trace with hash -79086300, now seen corresponding path program 1 times [2025-02-06 18:00:05,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:05,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [309171267] [2025-02-06 18:00:05,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:05,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:05,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:05,964 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:05,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 18:00:06,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 18:00:06,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 18:00:06,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:06,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:06,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:00:06,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 18:00:06,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:00:06,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:06,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309171267] [2025-02-06 18:00:06,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309171267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:06,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:06,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:00:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717032177] [2025-02-06 18:00:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:06,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:00:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:06,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:00:06,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:00:06,610 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-06 18:00:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:06,644 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2025-02-06 18:00:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:00:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 32 [2025-02-06 18:00:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:06,646 INFO L225 Difference]: With dead ends: 76 [2025-02-06 18:00:06,646 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 18:00:06,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:00:06,646 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:06,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:00:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 18:00:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 18:00:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 68 states have internal predecessors, (80), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2025-02-06 18:00:06,655 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 32 [2025-02-06 18:00:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:06,655 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2025-02-06 18:00:06,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-06 18:00:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2025-02-06 18:00:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 18:00:06,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:06,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:06,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:06,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:06,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1877228109, now seen corresponding path program 1 times [2025-02-06 18:00:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:06,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37724686] [2025-02-06 18:00:06,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:06,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:06,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:06,863 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-06 18:00:06,863 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-06 18:00:07,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 18:00:07,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 18:00:07,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:07,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:07,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:00:07,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 18:00:07,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:00:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 18:00:07,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37724686] [2025-02-06 18:00:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37724686] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:00:07,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 18:00:07,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-06 18:00:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784996180] [2025-02-06 18:00:07,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 18:00:07,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:00:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:07,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:00:07,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:07,656 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-06 18:00:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:07,760 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2025-02-06 18:00:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:00:07,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 35 [2025-02-06 18:00:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:07,763 INFO L225 Difference]: With dead ends: 82 [2025-02-06 18:00:07,763 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 18:00:07,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:00:07,764 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:07,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 18:00:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2025-02-06 18:00:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2025-02-06 18:00:07,773 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 35 [2025-02-06 18:00:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:07,773 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-02-06 18:00:07,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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-06 18:00:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2025-02-06 18:00:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 18:00:07,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:07,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:07,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:07,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:07,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:07,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2070688672, now seen corresponding path program 1 times [2025-02-06 18:00:07,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:07,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723772004] [2025-02-06 18:00:07,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:07,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:07,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:07,979 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:07,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 18:00:08,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 18:00:08,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 18:00:08,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:08,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:08,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:00:08,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:00:08,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:00:08,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:08,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723772004] [2025-02-06 18:00:08,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723772004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:08,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:08,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:00:08,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352811308] [2025-02-06 18:00:08,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:08,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:00:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:08,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:00:08,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:08,690 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:00:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:08,945 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2025-02-06 18:00:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:00:08,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-02-06 18:00:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:08,946 INFO L225 Difference]: With dead ends: 107 [2025-02-06 18:00:08,946 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 18:00:08,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:08,947 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 46 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:08,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:00:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 18:00:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-06 18:00:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2025-02-06 18:00:08,951 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 36 [2025-02-06 18:00:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:08,951 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2025-02-06 18:00:08,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:00:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2025-02-06 18:00:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 18:00:08,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:08,952 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:08,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:09,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:09,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:09,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:09,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1629023928, now seen corresponding path program 1 times [2025-02-06 18:00:09,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:09,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423304459] [2025-02-06 18:00:09,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:09,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:09,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:09,159 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:09,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 18:00:09,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 18:00:09,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 18:00:09,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:09,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:09,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:00:09,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:00:09,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:00:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:00:09,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423304459] [2025-02-06 18:00:09,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423304459] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:00:09,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 18:00:09,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-06 18:00:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648653422] [2025-02-06 18:00:09,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 18:00:09,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:00:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:09,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:00:09,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:09,977 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:10,275 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2025-02-06 18:00:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:00:10,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-02-06 18:00:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:10,277 INFO L225 Difference]: With dead ends: 92 [2025-02-06 18:00:10,277 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 18:00:10,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:00:10,277 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:10,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:00:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 18:00:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 61. [2025-02-06 18:00:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 54 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-02-06 18:00:10,293 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 38 [2025-02-06 18:00:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:10,293 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-06 18:00:10,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:00:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-02-06 18:00:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 18:00:10,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:10,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:10,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:10,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:10,495 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:10,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 21946872, now seen corresponding path program 1 times [2025-02-06 18:00:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:10,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404443494] [2025-02-06 18:00:10,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:10,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:10,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:10,499 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:10,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 18:00:10,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 18:00:11,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 18:00:11,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:11,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:11,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:00:11,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 18:00:11,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:00:11,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:11,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404443494] [2025-02-06 18:00:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404443494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:11,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:11,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:00:11,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786998298] [2025-02-06 18:00:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:11,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:00:11,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:11,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:00:11,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:11,286 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:00:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:11,393 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2025-02-06 18:00:11,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:00:11,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-02-06 18:00:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:11,395 INFO L225 Difference]: With dead ends: 82 [2025-02-06 18:00:11,396 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 18:00:11,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:00:11,398 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 8 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:11,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 201 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 18:00:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-02-06 18:00:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 55 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2025-02-06 18:00:11,408 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 46 [2025-02-06 18:00:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:11,409 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2025-02-06 18:00:11,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:00:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2025-02-06 18:00:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 18:00:11,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:11,411 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:11,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:11,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:11,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:11,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:11,613 INFO L85 PathProgramCache]: Analyzing trace with hash -891546394, now seen corresponding path program 1 times [2025-02-06 18:00:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:11,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158807061] [2025-02-06 18:00:11,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:11,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:11,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:11,617 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:11,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 18:00:11,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:00:12,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:00:12,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:12,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:12,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:00:12,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 18:00:12,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:00:12,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:12,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158807061] [2025-02-06 18:00:12,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158807061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:00:12,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:00:12,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:00:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785390997] [2025-02-06 18:00:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:00:12,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:00:12,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:12,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:00:12,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:00:12,400 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 18:00:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:12,469 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2025-02-06 18:00:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:00:12,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-02-06 18:00:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:12,470 INFO L225 Difference]: With dead ends: 69 [2025-02-06 18:00:12,470 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 18:00:12,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-06 18:00:12,471 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:12,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 18:00:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-06 18:00:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 57 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-02-06 18:00:12,475 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 50 [2025-02-06 18:00:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:12,475 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-02-06 18:00:12,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 18:00:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-02-06 18:00:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:00:12,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:12,476 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:12,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 18:00:12,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:12,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:12,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:12,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1755383537, now seen corresponding path program 1 times [2025-02-06 18:00:12,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:12,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995852854] [2025-02-06 18:00:12,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:00:12,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:12,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:12,681 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:12,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 18:00:12,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:00:13,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:00:13,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:00:13,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:13,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:00:13,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 18:00:13,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:00:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 18:00:13,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995852854] [2025-02-06 18:00:13,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995852854] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:00:13,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 18:00:13,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-06 18:00:13,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003211401] [2025-02-06 18:00:13,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 18:00:13,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:00:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:13,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:00:13,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:00:13,623 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:00:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:13,776 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2025-02-06 18:00:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:00:13,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2025-02-06 18:00:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:13,781 INFO L225 Difference]: With dead ends: 131 [2025-02-06 18:00:13,781 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 18:00:13,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:00:13,782 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:13,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 292 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:00:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 18:00:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 18:00:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-02-06 18:00:13,799 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 49 [2025-02-06 18:00:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:13,800 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-02-06 18:00:13,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:00:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-02-06 18:00:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 18:00:13,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:13,815 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:13,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:14,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:14,016 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:14,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2121321423, now seen corresponding path program 2 times [2025-02-06 18:00:14,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:14,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2065192158] [2025-02-06 18:00:14,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:00:14,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:14,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:14,020 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:14,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 18:00:14,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-06 18:00:16,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 18:00:16,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:00:16,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:00:16,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:00:16,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:00:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 18:00:16,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:00:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 18:00:16,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:00:16,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065192158] [2025-02-06 18:00:16,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065192158] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:00:16,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 18:00:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-06 18:00:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416645560] [2025-02-06 18:00:16,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 18:00:16,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:00:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:00:16,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:00:16,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:00:16,690 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 18:00:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:00:16,927 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2025-02-06 18:00:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:00:16,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 61 [2025-02-06 18:00:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:00:16,932 INFO L225 Difference]: With dead ends: 137 [2025-02-06 18:00:16,932 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 18:00:16,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:00:16,933 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:00:16,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 231 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:00:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 18:00:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-06 18:00:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.125) internal successors, (90), 81 states have internal predecessors, (90), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 18:00:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2025-02-06 18:00:16,943 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 61 [2025-02-06 18:00:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:00:16,944 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2025-02-06 18:00:16,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 18:00:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2025-02-06 18:00:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 18:00:16,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:00:16,944 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:00:16,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-06 18:00:17,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:17,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 18:00:17,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:00:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1132418191, now seen corresponding path program 3 times [2025-02-06 18:00:17,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:00:17,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283116823] [2025-02-06 18:00:17,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:00:17,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:00:17,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:00:17,150 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:00:17,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 18:00:17,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 9 equivalence classes.