./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/echo-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/echo-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 a4a230cce40eed7216e78addbce6b3ef4830ce5a9adefc3e86e3bd0189d80ac1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 17:57:59,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 17:57:59,241 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:57:59,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 17:57:59,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 17:57:59,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 17:57:59,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 17:57:59,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 17:57:59,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 17:57:59,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 17:57:59,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 17:57:59,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 17:57:59,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 17:57:59,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 17:57:59,278 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 17:57:59,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 17:57:59,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 17:57:59,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 17:57:59,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 17:57:59,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 17:57:59,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 17:57:59,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 17:57:59,279 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 17:57:59,279 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 17:57:59,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 17:57:59,279 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 17:57:59,279 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 17:57:59,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 17:57:59,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 17:57:59,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 17:57:59,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 17:57:59,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:57:59,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 17:57:59,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 17:57:59,281 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 17:57:59,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 17:57:59,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 17:57:59,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 17:57:59,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 17:57:59,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 17:57:59,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 17:57:59,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 17:57:59,281 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 -> a4a230cce40eed7216e78addbce6b3ef4830ce5a9adefc3e86e3bd0189d80ac1 [2025-02-06 17:57:59,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 17:57:59,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 17:57:59,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 17:57:59,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 17:57:59,586 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 17:57:59,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/echo-2.i [2025-02-06 17:58:01,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/514a4ca96/e916e5dd98a84ab79a926b55e26e29c5/FLAGcc1303c62 [2025-02-06 17:58:01,530 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 17:58:01,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/echo-2.i [2025-02-06 17:58:01,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/514a4ca96/e916e5dd98a84ab79a926b55e26e29c5/FLAGcc1303c62 [2025-02-06 17:58:02,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/514a4ca96/e916e5dd98a84ab79a926b55e26e29c5 [2025-02-06 17:58:02,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 17:58:02,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 17:58:02,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 17:58:02,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 17:58:02,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 17:58:02,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:58:02" (1/1) ... [2025-02-06 17:58:02,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed78ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:02, skipping insertion in model container [2025-02-06 17:58:02,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:58:02" (1/1) ... [2025-02-06 17:58:02,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 17:58:03,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:58:03,075 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 17:58:03,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 17:58:03,407 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 17:58:03,412 INFO L204 MainTranslator]: Completed translation [2025-02-06 17:58:03,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03 WrapperNode [2025-02-06 17:58:03,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 17:58:03,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 17:58:03,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 17:58:03,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 17:58:03,420 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:58:03" (1/1) ... [2025-02-06 17:58:03,454 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:58:03" (1/1) ... [2025-02-06 17:58:03,545 INFO L138 Inliner]: procedures = 599, calls = 554, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1063 [2025-02-06 17:58:03,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 17:58:03,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 17:58:03,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 17:58:03,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 17:58:03,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,585 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 17:58:03,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 17:58:03,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 17:58:03,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 17:58:03,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 17:58:03,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (1/1) ... [2025-02-06 17:58:03,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 17:58:03,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:03,734 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:58:03,738 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:58:03,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 17:58:03,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 17:58:03,758 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 17:58:03,758 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 17:58:03,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 17:58:03,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 17:58:03,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 17:58:03,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 17:58:03,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 17:58:03,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 17:58:03,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 17:58:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 17:58:03,759 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 17:58:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 17:58:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 17:58:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 17:58:03,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 17:58:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 17:58:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 17:58:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 17:58:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 17:58:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-02-06 17:58:03,760 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-02-06 17:58:03,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 17:58:04,104 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 17:58:04,105 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 17:58:08,421 INFO L? ?]: Removed 281 outVars from TransFormulas that were not future-live. [2025-02-06 17:58:08,422 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 17:58:08,446 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 17:58:08,447 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 17:58:08,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:58:08 BoogieIcfgContainer [2025-02-06 17:58:08,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 17:58:08,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 17:58:08,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 17:58:08,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 17:58:08,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:58:02" (1/3) ... [2025-02-06 17:58:08,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8b2b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:58:08, skipping insertion in model container [2025-02-06 17:58:08,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:58:03" (2/3) ... [2025-02-06 17:58:08,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8b2b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:58:08, skipping insertion in model container [2025-02-06 17:58:08,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:58:08" (3/3) ... [2025-02-06 17:58:08,459 INFO L128 eAbstractionObserver]: Analyzing ICFG echo-2.i [2025-02-06 17:58:08,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 17:58:08,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG echo-2.i that has 5 procedures, 232 locations, 1 initial locations, 19 loop locations, and 44 error locations. [2025-02-06 17:58:08,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 17:58:08,548 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;@2b26ebb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 17:58:08,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-06 17:58:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 174 states have (on average 1.6724137931034482) internal successors, (291), 218 states have internal predecessors, (291), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 17:58:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 17:58:08,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:08,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 17:58:08,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:08,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 11296703, now seen corresponding path program 1 times [2025-02-06 17:58:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:08,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127813015] [2025-02-06 17:58:08,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:09,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 17:58:09,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 17:58:09,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:09,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 17:58:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:09,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127813015] [2025-02-06 17:58:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127813015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:09,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:58:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654839112] [2025-02-06 17:58:09,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:09,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:09,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:09,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:09,669 INFO L87 Difference]: Start difference. First operand has 232 states, 174 states have (on average 1.6724137931034482) internal successors, (291), 218 states have internal predecessors, (291), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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:58:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:09,770 INFO L93 Difference]: Finished difference Result 370 states and 515 transitions. [2025-02-06 17:58:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:09,773 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:58:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:09,781 INFO L225 Difference]: With dead ends: 370 [2025-02-06 17:58:09,782 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 17:58:09,788 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:58:09,791 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:09,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 351 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 17:58:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-06 17:58:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.4827586206896552) internal successors, (172), 131 states have internal predecessors, (172), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 181 transitions. [2025-02-06 17:58:09,843 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 181 transitions. Word has length 4 [2025-02-06 17:58:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:09,843 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 181 transitions. [2025-02-06 17:58:09,843 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:58:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2025-02-06 17:58:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 17:58:09,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:09,845 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 17:58:09,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 17:58:09,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:09,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1532929004, now seen corresponding path program 1 times [2025-02-06 17:58:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:09,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773746785] [2025-02-06 17:58:09,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:10,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 17:58:10,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 17:58:10,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:10,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:10,525 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:58:10,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:10,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773746785] [2025-02-06 17:58:10,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773746785] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:10,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894335588] [2025-02-06 17:58:10,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:10,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:10,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:10,529 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:58:10,532 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:58:10,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 17:58:11,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 17:58:11,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:11,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:11,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:58:11,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:11,245 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:58:11,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:58:11,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894335588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:11,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:58:11,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 17:58:11,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525214795] [2025-02-06 17:58:11,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:11,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:58:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:11,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:58:11,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:58:11,247 INFO L87 Difference]: Start difference. First operand 139 states and 181 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:58:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:11,316 INFO L93 Difference]: Finished difference Result 139 states and 181 transitions. [2025-02-06 17:58:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:58:11,316 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:58:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:11,318 INFO L225 Difference]: With dead ends: 139 [2025-02-06 17:58:11,318 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 17:58:11,318 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:58:11,319 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 341 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:58:11,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 341 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 17:58:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-02-06 17:58:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 130 states have internal predecessors, (171), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2025-02-06 17:58:11,339 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 7 [2025-02-06 17:58:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:11,339 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2025-02-06 17:58:11,340 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:58:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2025-02-06 17:58:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 17:58:11,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:11,340 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 17:58:11,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 17:58:11,540 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:58:11,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:11,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:11,541 INFO L85 PathProgramCache]: Analyzing trace with hash 276159169, now seen corresponding path program 1 times [2025-02-06 17:58:11,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:11,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125956640] [2025-02-06 17:58:11,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:11,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:11,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 17:58:11,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 17:58:11,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:11,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:11,974 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:58:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125956640] [2025-02-06 17:58:11,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125956640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:11,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:11,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:58:11,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980148805] [2025-02-06 17:58:11,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:11,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:11,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:11,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:11,976 INFO L87 Difference]: Start difference. First operand 138 states and 180 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:58:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:12,001 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2025-02-06 17:58:12,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:12,002 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:58:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:12,003 INFO L225 Difference]: With dead ends: 138 [2025-02-06 17:58:12,003 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 17:58:12,003 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:58:12,004 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:12,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 17:58:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2025-02-06 17:58:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 114 states have (on average 1.4736842105263157) internal successors, (168), 127 states have internal predecessors, (168), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2025-02-06 17:58:12,014 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 8 [2025-02-06 17:58:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:12,015 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2025-02-06 17:58:12,015 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:58:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2025-02-06 17:58:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 17:58:12,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:12,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:12,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 17:58:12,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:12,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash -452752035, now seen corresponding path program 1 times [2025-02-06 17:58:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:12,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807312634] [2025-02-06 17:58:12,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:12,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:12,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:58:12,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:58:12,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:12,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:12,537 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:58:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807312634] [2025-02-06 17:58:12,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807312634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793433909] [2025-02-06 17:58:12,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:12,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:12,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:12,540 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:58:12,542 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:58:13,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 17:58:13,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 17:58:13,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:13,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:13,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 17:58:13,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:13,244 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:58:13,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:58:13,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793433909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:13,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:58:13,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 17:58:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769609458] [2025-02-06 17:58:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:13,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:13,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:13,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:13,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:58:13,246 INFO L87 Difference]: Start difference. First operand 135 states and 177 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:58:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:13,290 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2025-02-06 17:58:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:13,291 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:58:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:13,292 INFO L225 Difference]: With dead ends: 135 [2025-02-06 17:58:13,293 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 17:58:13,294 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:58:13,294 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 124 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 207 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:58:13,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 207 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 17:58:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-06 17:58:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 114 states have (on average 1.456140350877193) internal successors, (166), 125 states have internal predecessors, (166), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2025-02-06 17:58:13,307 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 12 [2025-02-06 17:58:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:13,308 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2025-02-06 17:58:13,309 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:58:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2025-02-06 17:58:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 17:58:13,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:13,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:13,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 17:58:13,513 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:58:13,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:13,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1150410902, now seen corresponding path program 1 times [2025-02-06 17:58:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995257539] [2025-02-06 17:58:13,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:13,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:58:13,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:58:13,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:13,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:13,983 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:58:13,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995257539] [2025-02-06 17:58:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995257539] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206809658] [2025-02-06 17:58:13,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:13,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:13,987 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:58:13,989 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:58:14,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 17:58:14,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 17:58:14,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:14,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:14,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:58:14,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:14,653 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:58:14,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:58:14,703 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:58:14,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206809658] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:58:14,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:58:14,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 17:58:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838323939] [2025-02-06 17:58:14,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:58:14,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:58:14,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:14,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:58:14,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:58:14,706 INFO L87 Difference]: Start difference. First operand 133 states and 175 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:58:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:14,762 INFO L93 Difference]: Finished difference Result 269 states and 355 transitions. [2025-02-06 17:58:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:58:14,763 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:58:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:14,764 INFO L225 Difference]: With dead ends: 269 [2025-02-06 17:58:14,764 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 17:58:14,764 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:58:14,765 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 4 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 338 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:58:14,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 17:58:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-06 17:58:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 134 states have internal predecessors, (175), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2025-02-06 17:58:14,782 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 13 [2025-02-06 17:58:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:14,782 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2025-02-06 17:58:14,782 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:58:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2025-02-06 17:58:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 17:58:14,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:14,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:14,792 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 17:58:14,985 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:58:14,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:14,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1728504509, now seen corresponding path program 2 times [2025-02-06 17:58:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:14,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030782979] [2025-02-06 17:58:14,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:58:14,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:15,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 17:58:15,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 17:58:15,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 17:58:15,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:15,604 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:58:15,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:15,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030782979] [2025-02-06 17:58:15,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030782979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:15,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:15,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 17:58:15,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500464275] [2025-02-06 17:58:15,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:15,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:58:15,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:15,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:58:15,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:58:15,607 INFO L87 Difference]: Start difference. First operand 142 states and 184 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:58:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:15,695 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2025-02-06 17:58:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:58:15,696 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:58:15,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:15,697 INFO L225 Difference]: With dead ends: 142 [2025-02-06 17:58:15,697 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 17:58:15,697 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:58:15,698 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 123 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:15,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 517 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:58:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 17:58:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-06 17:58:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 132 states have internal predecessors, (173), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2025-02-06 17:58:15,709 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 22 [2025-02-06 17:58:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:15,709 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2025-02-06 17:58:15,710 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:58:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2025-02-06 17:58:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 17:58:15,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:15,710 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:58:15,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 17:58:15,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:15,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash 119791141, now seen corresponding path program 1 times [2025-02-06 17:58:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:15,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141862525] [2025-02-06 17:58:15,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:15,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 17:58:16,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 17:58:16,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:16,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:16,279 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:58:16,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:16,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141862525] [2025-02-06 17:58:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141862525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:16,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:16,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:58:16,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964906753] [2025-02-06 17:58:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:16,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:16,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:16,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:16,281 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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:58:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:16,321 INFO L93 Difference]: Finished difference Result 263 states and 348 transitions. [2025-02-06 17:58:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:16,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) 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:58:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:16,323 INFO L225 Difference]: With dead ends: 263 [2025-02-06 17:58:16,323 INFO L226 Difference]: Without dead ends: 143 [2025-02-06 17:58:16,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:16,324 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:16,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 331 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-06 17:58:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-02-06 17:58:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 135 states have internal predecessors, (176), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 185 transitions. [2025-02-06 17:58:16,338 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 185 transitions. Word has length 27 [2025-02-06 17:58:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:16,338 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 185 transitions. [2025-02-06 17:58:16,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) 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:58:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 185 transitions. [2025-02-06 17:58:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 17:58:16,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:16,345 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:16,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 17:58:16,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:16,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash -414891914, now seen corresponding path program 1 times [2025-02-06 17:58:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:16,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674846667] [2025-02-06 17:58:16,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:16,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:16,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:58:16,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:58:16,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:16,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 17:58:16,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:16,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674846667] [2025-02-06 17:58:16,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674846667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:16,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:16,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:58:16,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966298812] [2025-02-06 17:58:16,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:16,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:16,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:16,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:16,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:16,833 INFO L87 Difference]: Start difference. First operand 143 states and 185 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:58:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:16,883 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2025-02-06 17:58:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:16,884 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 30 [2025-02-06 17:58:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:16,885 INFO L225 Difference]: With dead ends: 156 [2025-02-06 17:58:16,885 INFO L226 Difference]: Without dead ends: 154 [2025-02-06 17:58:16,885 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:58:16,885 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 3 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:16,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-06 17:58:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2025-02-06 17:58:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 135 states have (on average 1.4) internal successors, (189), 144 states have internal predecessors, (189), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2025-02-06 17:58:16,898 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2025-02-06 17:58:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:16,898 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2025-02-06 17:58:16,898 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:58:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2025-02-06 17:58:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 17:58:16,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:16,899 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:58:16,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 17:58:16,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:16,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash -414891754, now seen corresponding path program 1 times [2025-02-06 17:58:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756880620] [2025-02-06 17:58:16,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:17,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:58:17,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:58:17,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:17,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:17,356 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:58:17,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:17,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756880620] [2025-02-06 17:58:17,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756880620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:17,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482932003] [2025-02-06 17:58:17,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:17,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:17,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:17,360 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:58:17,363 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:58:17,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 17:58:18,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 17:58:18,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:18,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:18,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 17:58:18,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:18,224 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:58:18,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:58:18,364 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:58:18,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482932003] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:58:18,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:58:18,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 17:58:18,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848547984] [2025-02-06 17:58:18,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:58:18,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 17:58:18,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:18,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 17:58:18,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 17:58:18,366 INFO L87 Difference]: Start difference. First operand 152 states and 198 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:58:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:18,505 INFO L93 Difference]: Finished difference Result 306 states and 404 transitions. [2025-02-06 17:58:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 17:58:18,506 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:58:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:18,507 INFO L225 Difference]: With dead ends: 306 [2025-02-06 17:58:18,507 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 17:58:18,507 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:58:18,508 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 5 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:18,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 642 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:58:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 17:58:18,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-02-06 17:58:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 153 states have (on average 1.3398692810457515) internal successors, (205), 161 states have internal predecessors, (205), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 214 transitions. [2025-02-06 17:58:18,516 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 214 transitions. Word has length 30 [2025-02-06 17:58:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:18,516 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 214 transitions. [2025-02-06 17:58:18,516 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:58:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 214 transitions. [2025-02-06 17:58:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 17:58:18,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:18,517 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:58:18,530 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:58:18,718 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,SelfDestructingSolverStorable8 [2025-02-06 17:58:18,718 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:18,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1887872985, now seen corresponding path program 1 times [2025-02-06 17:58:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:18,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571298709] [2025-02-06 17:58:18,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:18,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 17:58:19,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 17:58:19,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:19,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:19,165 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:58:19,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:19,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571298709] [2025-02-06 17:58:19,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571298709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:19,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:19,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:58:19,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245744787] [2025-02-06 17:58:19,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:19,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:19,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:19,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:19,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:19,168 INFO L87 Difference]: Start difference. First operand 169 states and 214 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:58:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:19,197 INFO L93 Difference]: Finished difference Result 169 states and 214 transitions. [2025-02-06 17:58:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:19,197 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:58:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:19,198 INFO L225 Difference]: With dead ends: 169 [2025-02-06 17:58:19,198 INFO L226 Difference]: Without dead ends: 168 [2025-02-06 17:58:19,198 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:58:19,199 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 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:58:19,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-06 17:58:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2025-02-06 17:58:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 149 states have (on average 1.3355704697986577) internal successors, (199), 156 states have internal predecessors, (199), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 208 transitions. [2025-02-06 17:58:19,208 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 208 transitions. Word has length 49 [2025-02-06 17:58:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:19,208 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 208 transitions. [2025-02-06 17:58:19,208 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:58:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 208 transitions. [2025-02-06 17:58:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 17:58:19,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:19,212 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:58:19,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 17:58:19,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:19,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1908678691, now seen corresponding path program 1 times [2025-02-06 17:58:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:19,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089971524] [2025-02-06 17:58:19,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:19,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:58:19,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:58:19,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:19,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:19,736 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:58:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089971524] [2025-02-06 17:58:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089971524] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673695721] [2025-02-06 17:58:19,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:19,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:19,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:19,740 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:58:19,742 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:58:20,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 17:58:20,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 17:58:20,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:20,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:20,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 17:58:20,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:20,584 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:58:20,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 17:58:20,612 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:58:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673695721] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 17:58:20,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 17:58:20,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 17:58:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292170643] [2025-02-06 17:58:20,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 17:58:20,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 17:58:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:20,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 17:58:20,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:58:20,614 INFO L87 Difference]: Start difference. First operand 164 states and 208 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:58:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:20,675 INFO L93 Difference]: Finished difference Result 303 states and 393 transitions. [2025-02-06 17:58:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 17:58:20,676 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:58:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:20,677 INFO L225 Difference]: With dead ends: 303 [2025-02-06 17:58:20,677 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 17:58:20,678 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:58:20,678 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 4 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:20,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 655 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 17:58:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-02-06 17:58:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 167 states have (on average 1.2994011976047903) internal successors, (217), 174 states have internal predecessors, (217), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2025-02-06 17:58:20,690 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 226 transitions. Word has length 55 [2025-02-06 17:58:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:20,690 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 226 transitions. [2025-02-06 17:58:20,690 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:58:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 226 transitions. [2025-02-06 17:58:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 17:58:20,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:20,693 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:20,706 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:58:20,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 17:58:20,894 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting bb_verror_msgErr25ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:20,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1676990004, now seen corresponding path program 1 times [2025-02-06 17:58:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676109243] [2025-02-06 17:58:20,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:21,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 17:58:21,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 17:58:21,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:21,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676109243] [2025-02-06 17:58:21,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676109243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:21,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:21,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:58:21,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902349603] [2025-02-06 17:58:21,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:21,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:21,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:21,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:21,347 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:21,369 INFO L93 Difference]: Finished difference Result 273 states and 346 transitions. [2025-02-06 17:58:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:21,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-02-06 17:58:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:21,371 INFO L225 Difference]: With dead ends: 273 [2025-02-06 17:58:21,371 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 17:58:21,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:21,371 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:21,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 324 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 17:58:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-02-06 17:58:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 172 states have internal predecessors, (214), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 222 transitions. [2025-02-06 17:58:21,385 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 222 transitions. Word has length 58 [2025-02-06 17:58:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:21,387 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 222 transitions. [2025-02-06 17:58:21,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 17:58:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2025-02-06 17:58:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 17:58:21,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:21,390 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:21,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 17:58:21,391 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:21,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2006086824, now seen corresponding path program 1 times [2025-02-06 17:58:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:21,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987152960] [2025-02-06 17:58:21,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:21,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:21,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 17:58:21,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 17:58:21,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:21,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:21,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:21,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987152960] [2025-02-06 17:58:21,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987152960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:21,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:21,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 17:58:21,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970990016] [2025-02-06 17:58:21,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:21,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 17:58:21,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:21,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 17:58:21,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 17:58:21,831 INFO L87 Difference]: Start difference. First operand 180 states and 222 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 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:58:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:21,867 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2025-02-06 17:58:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 17:58:21,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 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 67 [2025-02-06 17:58:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:21,869 INFO L225 Difference]: With dead ends: 185 [2025-02-06 17:58:21,869 INFO L226 Difference]: Without dead ends: 183 [2025-02-06 17:58:21,869 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:58:21,869 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 320 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:58:21,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 320 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-06 17:58:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-02-06 17:58:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 175 states have internal predecessors, (217), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 225 transitions. [2025-02-06 17:58:21,879 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 225 transitions. Word has length 67 [2025-02-06 17:58:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:21,879 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 225 transitions. [2025-02-06 17:58:21,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 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:58:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 225 transitions. [2025-02-06 17:58:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 17:58:21,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:21,881 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:21,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 17:58:21,881 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:21,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:21,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1137227791, now seen corresponding path program 1 times [2025-02-06 17:58:21,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:21,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017598597] [2025-02-06 17:58:21,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:22,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 17:58:22,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 17:58:22,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:22,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:22,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017598597] [2025-02-06 17:58:22,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017598597] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:22,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046587979] [2025-02-06 17:58:22,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:22,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:22,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:22,343 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:58:22,344 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:58:22,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 17:58:23,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 17:58:23,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:23,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:23,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 17:58:23,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 17:58:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 17:58:23,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 17:58:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046587979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:23,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 17:58:23,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-02-06 17:58:23,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568525994] [2025-02-06 17:58:23,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:23,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:58:23,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:23,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:58:23,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:58:23,193 INFO L87 Difference]: Start difference. First operand 183 states and 225 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:58:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:23,282 INFO L93 Difference]: Finished difference Result 263 states and 337 transitions. [2025-02-06 17:58:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:58:23,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2025-02-06 17:58:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:23,284 INFO L225 Difference]: With dead ends: 263 [2025-02-06 17:58:23,284 INFO L226 Difference]: Without dead ends: 252 [2025-02-06 17:58:23,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 17:58:23,285 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 89 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:23,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 567 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:58:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-06 17:58:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-02-06 17:58:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 236 states have (on average 1.326271186440678) internal successors, (313), 243 states have internal predecessors, (313), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 17:58:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 324 transitions. [2025-02-06 17:58:23,300 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 324 transitions. Word has length 70 [2025-02-06 17:58:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:23,300 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 324 transitions. [2025-02-06 17:58:23,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:58:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 324 transitions. [2025-02-06 17:58:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 17:58:23,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:23,302 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:23,316 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:58:23,502 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,SelfDestructingSolverStorable13 [2025-02-06 17:58:23,503 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr25ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:23,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2047413924, now seen corresponding path program 1 times [2025-02-06 17:58:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844199801] [2025-02-06 17:58:23,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:23,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 17:58:23,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 17:58:23,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:23,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:23,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:23,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844199801] [2025-02-06 17:58:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844199801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:23,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:23,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 17:58:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175458715] [2025-02-06 17:58:23,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:23,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:58:23,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:23,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:58:23,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:58:23,932 INFO L87 Difference]: Start difference. First operand 252 states and 324 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:58:27,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 17:58:28,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:28,074 INFO L93 Difference]: Finished difference Result 274 states and 347 transitions. [2025-02-06 17:58:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:58:28,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2025-02-06 17:58:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:28,076 INFO L225 Difference]: With dead ends: 274 [2025-02-06 17:58:28,076 INFO L226 Difference]: Without dead ends: 252 [2025-02-06 17:58:28,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:58:28,077 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:28,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 450 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 17:58:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-06 17:58:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-02-06 17:58:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 236 states have (on average 1.3177966101694916) internal successors, (311), 243 states have internal predecessors, (311), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 17:58:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 322 transitions. [2025-02-06 17:58:28,092 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 322 transitions. Word has length 72 [2025-02-06 17:58:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:28,092 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 322 transitions. [2025-02-06 17:58:28,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:58:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 322 transitions. [2025-02-06 17:58:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 17:58:28,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:28,093 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 17:58:28,093 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_verror_msgErr25ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:28,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash -713612954, now seen corresponding path program 1 times [2025-02-06 17:58:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:28,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217276753] [2025-02-06 17:58:28,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:28,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:28,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 17:58:28,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 17:58:28,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:28,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:28,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:28,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217276753] [2025-02-06 17:58:28,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217276753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:28,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:28,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 17:58:28,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666940401] [2025-02-06 17:58:28,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:28,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 17:58:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:28,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 17:58:28,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:58:28,591 INFO L87 Difference]: Start difference. First operand 252 states and 322 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:58:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:28,625 INFO L93 Difference]: Finished difference Result 256 states and 325 transitions. [2025-02-06 17:58:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 17:58:28,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2025-02-06 17:58:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:28,627 INFO L225 Difference]: With dead ends: 256 [2025-02-06 17:58:28,627 INFO L226 Difference]: Without dead ends: 252 [2025-02-06 17:58:28,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 17:58:28,628 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 16 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:28,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 618 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-06 17:58:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-02-06 17:58:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 243 states have internal predecessors, (310), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 17:58:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 321 transitions. [2025-02-06 17:58:28,640 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 321 transitions. Word has length 74 [2025-02-06 17:58:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:28,640 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 321 transitions. [2025-02-06 17:58:28,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 17:58:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 321 transitions. [2025-02-06 17:58:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 17:58:28,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:28,641 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 17:58:28,644 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting bb_verror_msgErr25ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:28,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash -713583163, now seen corresponding path program 1 times [2025-02-06 17:58:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550062233] [2025-02-06 17:58:28,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:28,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 17:58:28,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 17:58:28,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:28,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 17:58:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550062233] [2025-02-06 17:58:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550062233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:29,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:29,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 17:58:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056072533] [2025-02-06 17:58:29,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:29,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:58:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:29,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:58:29,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:58:29,282 INFO L87 Difference]: Start difference. First operand 252 states and 321 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:58:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:29,417 INFO L93 Difference]: Finished difference Result 265 states and 333 transitions. [2025-02-06 17:58:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:58:29,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2025-02-06 17:58:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:29,420 INFO L225 Difference]: With dead ends: 265 [2025-02-06 17:58:29,421 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 17:58:29,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 17:58:29,421 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 35 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:29,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 372 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 17:58:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 17:58:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-02-06 17:58:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 222 states have (on average 1.3153153153153154) internal successors, (292), 228 states have internal predecessors, (292), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 17:58:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 299 transitions. [2025-02-06 17:58:29,431 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 299 transitions. Word has length 74 [2025-02-06 17:58:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:29,431 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 299 transitions. [2025-02-06 17:58:29,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:58:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 299 transitions. [2025-02-06 17:58:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 17:58:29,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:29,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 17:58:29,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 17:58:29,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:29,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1525382257, now seen corresponding path program 1 times [2025-02-06 17:58:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176533623] [2025-02-06 17:58:29,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 17:58:29,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:29,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 17:58:29,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 17:58:29,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 17:58:29,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:29,917 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:58:29,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176533623] [2025-02-06 17:58:29,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176533623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 17:58:29,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 17:58:29,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 17:58:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385260569] [2025-02-06 17:58:29,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 17:58:29,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 17:58:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 17:58:29,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 17:58:29,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:58:29,920 INFO L87 Difference]: Start difference. First operand 235 states and 299 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:58:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 17:58:29,958 INFO L93 Difference]: Finished difference Result 262 states and 333 transitions. [2025-02-06 17:58:29,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 17:58:29,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2025-02-06 17:58:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 17:58:29,959 INFO L225 Difference]: With dead ends: 262 [2025-02-06 17:58:29,959 INFO L226 Difference]: Without dead ends: 248 [2025-02-06 17:58:29,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 17:58:29,960 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 5 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 17:58:29,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 288 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 17:58:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-06 17:58:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2025-02-06 17:58:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 233 states have (on average 1.3175965665236051) internal successors, (307), 239 states have internal predecessors, (307), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 17:58:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 316 transitions. [2025-02-06 17:58:29,970 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 316 transitions. Word has length 74 [2025-02-06 17:58:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 17:58:29,970 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 316 transitions. [2025-02-06 17:58:29,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 17:58:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 316 transitions. [2025-02-06 17:58:29,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 17:58:29,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 17:58:29,971 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:58:29,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 17:58:29,971 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 41 more)] === [2025-02-06 17:58:29,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 17:58:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash -315198835, now seen corresponding path program 2 times [2025-02-06 17:58:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 17:58:29,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891762169] [2025-02-06 17:58:29,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:58:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 17:58:30,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 17:58:30,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 17:58:30,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 17:58:30,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 17:58:30,537 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:58:30,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 17:58:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891762169] [2025-02-06 17:58:30,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891762169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 17:58:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862920830] [2025-02-06 17:58:30,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 17:58:30,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 17:58:30,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 17:58:30,540 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:58:30,542 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:58:31,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.