./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/Binary_Search-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/Binary_Search-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 46affb860f1d0d7b6656a3074088d89f6e139022ec85b08907ba16419f351bb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:43:50,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:43:50,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:43:50,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:43:50,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:43:50,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:43:50,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:43:50,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:43:50,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:43:50,281 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:43:50,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:43:50,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:43:50,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:43:50,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:43:50,282 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:43:50,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:43:50,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:43:50,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:43:50,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:43:50,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:43:50,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:43:50,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:43:50,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:43:50,284 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/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 -> 46affb860f1d0d7b6656a3074088d89f6e139022ec85b08907ba16419f351bb9 [2025-03-17 14:43:50,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:43:50,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:43:50,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:43:50,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:43:50,496 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:43:50,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Binary_Search-2.c [2025-03-17 14:43:51,578 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59161dadf/55038e0410944c529f11c339c9cc1bd9/FLAG6c78f3706 [2025-03-17 14:43:51,779 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:43:51,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Binary_Search-2.c [2025-03-17 14:43:51,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59161dadf/55038e0410944c529f11c339c9cc1bd9/FLAG6c78f3706 [2025-03-17 14:43:52,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59161dadf/55038e0410944c529f11c339c9cc1bd9 [2025-03-17 14:43:52,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:43:52,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:43:52,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:43:52,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:43:52,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:43:52,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52, skipping insertion in model container [2025-03-17 14:43:52,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:43:52,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:43:52,241 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:43:52,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:43:52,263 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:43:52,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52 WrapperNode [2025-03-17 14:43:52,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:43:52,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:43:52,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:43:52,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:43:52,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,282 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-03-17 14:43:52,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:43:52,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:43:52,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:43:52,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:43:52,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,300 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:43:52,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:43:52,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:43:52,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:43:52,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:43:52,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (1/1) ... [2025-03-17 14:43:52,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:43:52,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:43:52,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:43:52,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:43:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure binary_search [2025-03-17 14:43:52,362 INFO L138 BoogieDeclarations]: Found implementation of procedure binary_search [2025-03-17 14:43:52,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:43:52,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:43:52,402 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:43:52,404 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:43:52,515 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: havoc #t~ret2; [2025-03-17 14:43:52,557 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 14:43:52,557 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:43:52,566 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:43:52,566 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:43:52,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:52 BoogieIcfgContainer [2025-03-17 14:43:52,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:43:52,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:43:52,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:43:52,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:43:52,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:43:52" (1/3) ... [2025-03-17 14:43:52,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1034e60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:52, skipping insertion in model container [2025-03-17 14:43:52,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:52" (2/3) ... [2025-03-17 14:43:52,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1034e60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:52, skipping insertion in model container [2025-03-17 14:43:52,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:52" (3/3) ... [2025-03-17 14:43:52,576 INFO L128 eAbstractionObserver]: Analyzing ICFG Binary_Search-2.c [2025-03-17 14:43:52,589 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:43:52,591 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Binary_Search-2.c that has 2 procedures, 29 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 14:43:52,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:43:52,651 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;@1e7a70d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:43:52,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:43:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 14:43:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:43:52,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:43:52,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:43:52,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting binary_searchErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [binary_searchErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, binary_searchErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, binary_searchErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:43:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:43:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash 992672201, now seen corresponding path program 1 times [2025-03-17 14:43:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:43:52,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412857274] [2025-03-17 14:43:52,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:43:52,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:43:52,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:43:52,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:43:52,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:43:52,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:43:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:43:52,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:43:52,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412857274] [2025-03-17 14:43:52,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412857274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:43:52,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:43:52,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:43:52,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826839327] [2025-03-17 14:43:52,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:43:52,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:43:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:43:52,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:43:52,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:43:52,846 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:43:53,008 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-03-17 14:43:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:43:53,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:43:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:43:53,014 INFO L225 Difference]: With dead ends: 53 [2025-03-17 14:43:53,014 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 14:43:53,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:43:53,018 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:43:53,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 112 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:43:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 14:43:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2025-03-17 14:43:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-17 14:43:53,044 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 7 [2025-03-17 14:43:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:43:53,044 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-17 14:43:53,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-17 14:43:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:43:53,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:43:53,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:43:53,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:43:53,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting binary_searchErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [binary_searchErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, binary_searchErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, binary_searchErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:43:53,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:43:53,046 INFO L85 PathProgramCache]: Analyzing trace with hash 708067144, now seen corresponding path program 1 times [2025-03-17 14:43:53,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:43:53,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107872281] [2025-03-17 14:43:53,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:43:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:43:53,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:43:53,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:43:53,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:43:53,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:43:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:43:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:43:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107872281] [2025-03-17 14:43:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107872281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:43:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:43:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:43:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140834594] [2025-03-17 14:43:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:43:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:43:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:43:53,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:43:53,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:43:53,109 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:43:53,200 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2025-03-17 14:43:53,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:43:53,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 14:43:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:43:53,202 INFO L225 Difference]: With dead ends: 54 [2025-03-17 14:43:53,202 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 14:43:53,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:43:53,204 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:43:53,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 62 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:43:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 14:43:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2025-03-17 14:43:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.457142857142857) internal successors, (51), 41 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-03-17 14:43:53,212 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 8 [2025-03-17 14:43:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:43:53,212 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-03-17 14:43:53,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-03-17 14:43:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:43:53,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:43:53,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:43:53,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:43:53,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting binary_searchErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [binary_searchErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, binary_searchErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, binary_searchErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:43:53,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:43:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1810585377, now seen corresponding path program 1 times [2025-03-17 14:43:53,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:43:53,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112339322] [2025-03-17 14:43:53,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:43:53,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:43:53,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:43:53,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:43:53,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:43:53,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:43:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:43:53,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:43:53,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112339322] [2025-03-17 14:43:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112339322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:43:53,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:43:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:43:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421280775] [2025-03-17 14:43:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:43:53,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:43:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:43:53,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:43:53,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:43:53,354 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:43:53,428 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2025-03-17 14:43:53,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:43:53,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:43:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:43:53,431 INFO L225 Difference]: With dead ends: 46 [2025-03-17 14:43:53,431 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 14:43:53,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:43:53,432 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 39 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:43:53,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 26 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:43:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 14:43:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2025-03-17 14:43:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-17 14:43:53,439 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2025-03-17 14:43:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:43:53,440 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-17 14:43:53,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-03-17 14:43:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:43:53,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:43:53,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:43:53,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:43:53,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting binary_searchErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [binary_searchErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, binary_searchErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, binary_searchErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:43:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:43:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash 293571812, now seen corresponding path program 1 times [2025-03-17 14:43:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:43:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472121055] [2025-03-17 14:43:53,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:43:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:43:53,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:43:53,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:43:53,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:43:53,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:43:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:43:53,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:43:53,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472121055] [2025-03-17 14:43:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472121055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:43:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:43:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:43:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536842615] [2025-03-17 14:43:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:43:53,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:43:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:43:53,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:43:53,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:43:53,545 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:43:53,597 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-03-17 14:43:53,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:43:53,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 14:43:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:43:53,598 INFO L225 Difference]: With dead ends: 28 [2025-03-17 14:43:53,598 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:43:53,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:43:53,599 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:43:53,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:43:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:43:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:43:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:43:53,602 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2025-03-17 14:43:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:43:53,602 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:43:53,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:43:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:43:53,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:43:53,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location binary_searchErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 14:43:53,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location binary_searchErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 14:43:53,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location binary_searchErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 14:43:53,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location binary_searchErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 14:43:53,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location binary_searchErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 14:43:53,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location binary_searchErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 14:43:53,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:43:53,607 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 14:43:53,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:43:53,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:43:53,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:43:53 BoogieIcfgContainer [2025-03-17 14:43:53,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:43:53,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:43:53,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:43:53,717 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:43:53,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:52" (3/4) ... [2025-03-17 14:43:53,719 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:43:53,723 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure binary_search [2025-03-17 14:43:53,727 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-17 14:43:53,727 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:43:53,727 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 14:43:53,785 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:43:53,785 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:43:53,785 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:43:53,788 INFO L158 Benchmark]: Toolchain (without parser) took 1650.95ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 106.9MB in the end (delta: 17.7MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2025-03-17 14:43:53,788 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:43:53,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 128.24ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 114.5MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:43:53,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.64ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 113.8MB in the end (delta: 726.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:43:53,789 INFO L158 Benchmark]: Boogie Preprocessor took 24.91ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 113.1MB in the end (delta: 738.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:43:53,790 INFO L158 Benchmark]: IcfgBuilder took 258.31ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 100.0MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:43:53,790 INFO L158 Benchmark]: TraceAbstraction took 1146.68ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 112.6MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:43:53,791 INFO L158 Benchmark]: Witness Printer took 68.36ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 106.9MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:43:53,791 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 128.24ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 114.5MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.64ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 113.8MB in the end (delta: 726.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.91ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 113.1MB in the end (delta: 738.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 258.31ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 100.0MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1146.68ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 112.6MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 68.36ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 106.9MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 37 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 55 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=2, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 14:43:53,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE