./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/openssl-simplified/s3_srvr_1a.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:24:44,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:24:44,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:24:44,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:24:44,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:24:44,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:24:44,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:24:44,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:24:44,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:24:44,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:24:44,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:24:44,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:24:44,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:24:44,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:24:44,563 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:24:44,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:24:44,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:24:44,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:24:44,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:24:44,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:24:44,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:24:44,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:24:44,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:24:44,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:24:44,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:24:44,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:24:44,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:24:44,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:24:44,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:24:44,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:24:44,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:24:44,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:24:44,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:24:44,566 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:24:44,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:24:44,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:24:44,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:24:44,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:24:44,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:24:44,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:24:44,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:24:44,567 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f [2025-01-10 01:24:44,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:24:44,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:24:44,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:24:44,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:24:44,853 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:24:44,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2025-01-10 01:24:46,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44a9f7051/8844093b81c34680a94686076ec5c05d/FLAG6d35ae0ab [2025-01-10 01:24:46,403 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:24:46,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2025-01-10 01:24:46,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44a9f7051/8844093b81c34680a94686076ec5c05d/FLAG6d35ae0ab [2025-01-10 01:24:46,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44a9f7051/8844093b81c34680a94686076ec5c05d [2025-01-10 01:24:46,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:24:46,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:24:46,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:24:46,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:24:46,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:24:46,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f809624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46, skipping insertion in model container [2025-01-10 01:24:46,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:24:46,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:24:46,889 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:24:46,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:24:46,932 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:24:46,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46 WrapperNode [2025-01-10 01:24:46,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:24:46,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:24:46,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:24:46,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:24:46,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,960 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 147 [2025-01-10 01:24:46,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:24:46,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:24:46,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:24:46,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:24:46,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:24:46,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:24:46,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:24:46,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:24:46,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:24:46,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (1/1) ... [2025-01-10 01:24:46,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:24:47,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:24:47,020 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-01-10 01:24:47,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:24:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:24:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:24:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:24:47,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:24:47,088 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:24:47,089 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:24:47,261 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-01-10 01:24:47,261 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:24:47,269 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:24:47,270 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:24:47,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:24:47 BoogieIcfgContainer [2025-01-10 01:24:47,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:24:47,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:24:47,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:24:47,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:24:47,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:24:46" (1/3) ... [2025-01-10 01:24:47,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9df03bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:24:47, skipping insertion in model container [2025-01-10 01:24:47,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:24:46" (2/3) ... [2025-01-10 01:24:47,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9df03bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:24:47, skipping insertion in model container [2025-01-10 01:24:47,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:24:47" (3/3) ... [2025-01-10 01:24:47,279 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2025-01-10 01:24:47,292 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:24:47,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_1a.cil.c that has 1 procedures, 57 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-01-10 01:24:47,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:24:47,360 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;@131890f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:24:47,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:24:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 50 states have (on average 1.7) internal successors, (85), 56 states have internal predecessors, (85), 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-01-10 01:24:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:24:47,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:24:47,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:24:47,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:24:47,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:24:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash -272075503, now seen corresponding path program 1 times [2025-01-10 01:24:47,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:24:47,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377272521] [2025-01-10 01:24:47,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:24:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:24:47,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:24:47,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:24:47,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:24:47,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:24:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:24:47,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:24:47,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377272521] [2025-01-10 01:24:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377272521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:24:47,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:24:47,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:24:47,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854280314] [2025-01-10 01:24:47,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:24:47,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:24:47,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:24:47,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:24:47,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:24:47,549 INFO L87 Difference]: Start difference. First operand has 57 states, 50 states have (on average 1.7) internal successors, (85), 56 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:24:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:24:47,647 INFO L93 Difference]: Finished difference Result 113 states and 172 transitions. [2025-01-10 01:24:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:24:47,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:24:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:24:47,657 INFO L225 Difference]: With dead ends: 113 [2025-01-10 01:24:47,657 INFO L226 Difference]: Without dead ends: 53 [2025-01-10 01:24:47,660 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-01-10 01:24:47,662 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:24:47,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:24:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-10 01:24:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-10 01:24:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 52 states have internal predecessors, (76), 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-01-10 01:24:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2025-01-10 01:24:47,695 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 9 [2025-01-10 01:24:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:24:47,695 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2025-01-10 01:24:47,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:24:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2025-01-10 01:24:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:24:47,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:24:47,696 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:24:47,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:24:47,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:24:47,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:24:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash -670352662, now seen corresponding path program 1 times [2025-01-10 01:24:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:24:47,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438892712] [2025-01-10 01:24:47,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:24:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:24:47,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:24:47,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:24:47,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:24:47,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:24:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:24:47,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:24:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438892712] [2025-01-10 01:24:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438892712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:24:47,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:24:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:24:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47588759] [2025-01-10 01:24:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:24:47,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:24:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:24:47,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:24:47,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:24:47,766 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:24:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:24:47,846 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2025-01-10 01:24:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:24:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:24:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:24:47,848 INFO L225 Difference]: With dead ends: 107 [2025-01-10 01:24:47,849 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 01:24:47,849 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-01-10 01:24:47,850 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:24:47,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:24:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 01:24:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 01:24:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.58) internal successors, (79), 55 states have internal predecessors, (79), 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-01-10 01:24:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2025-01-10 01:24:47,860 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 13 [2025-01-10 01:24:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:24:47,860 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2025-01-10 01:24:47,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:24:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2025-01-10 01:24:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:24:47,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:24:47,861 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:24:47,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:24:47,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:24:47,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:24:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1466825067, now seen corresponding path program 1 times [2025-01-10 01:24:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:24:47,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924783944] [2025-01-10 01:24:47,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:24:47,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:24:47,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:24:47,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:24:47,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:24:47,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:24:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:24:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:24:47,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924783944] [2025-01-10 01:24:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924783944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:24:47,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:24:47,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:24:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813256872] [2025-01-10 01:24:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:24:47,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:24:47,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:24:47,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:24:47,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:24:47,949 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 01:24:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:24:48,046 INFO L93 Difference]: Finished difference Result 123 states and 180 transitions. [2025-01-10 01:24:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:24:48,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-10 01:24:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:24:48,047 INFO L225 Difference]: With dead ends: 123 [2025-01-10 01:24:48,048 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 01:24:48,048 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-01-10 01:24:48,049 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:24:48,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:24:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 01:24:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-01-10 01:24:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 66 states have internal predecessors, (90), 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-01-10 01:24:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2025-01-10 01:24:48,060 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 18 [2025-01-10 01:24:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:24:48,061 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2025-01-10 01:24:48,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 01:24:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2025-01-10 01:24:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:24:48,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:24:48,062 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:24:48,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:24:48,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:24:48,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:24:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash 657478441, now seen corresponding path program 1 times [2025-01-10 01:24:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:24:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097345353] [2025-01-10 01:24:48,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:24:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:24:48,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:24:48,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:24:48,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:24:48,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:24:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:24:48,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:24:48,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097345353] [2025-01-10 01:24:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097345353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:24:48,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:24:48,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:24:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672438603] [2025-01-10 01:24:48,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:24:48,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:24:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:24:48,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:24:48,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:24:48,102 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 01:24:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:24:48,173 INFO L93 Difference]: Finished difference Result 136 states and 185 transitions. [2025-01-10 01:24:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:24:48,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-10 01:24:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:24:48,174 INFO L225 Difference]: With dead ends: 136 [2025-01-10 01:24:48,174 INFO L226 Difference]: Without dead ends: 71 [2025-01-10 01:24:48,175 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-01-10 01:24:48,175 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:24:48,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:24:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-10 01:24:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-10 01:24:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 70 states have internal predecessors, (94), 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-01-10 01:24:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2025-01-10 01:24:48,181 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 18 [2025-01-10 01:24:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:24:48,181 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2025-01-10 01:24:48,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-01-10 01:24:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2025-01-10 01:24:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:24:48,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:24:48,182 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:24:48,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:24:48,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:24:48,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:24:48,183 INFO L85 PathProgramCache]: Analyzing trace with hash -613655062, now seen corresponding path program 1 times [2025-01-10 01:24:48,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:24:48,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789816398] [2025-01-10 01:24:48,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:24:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:24:48,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:24:48,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:24:48,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:24:48,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:24:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:24:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:24:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789816398] [2025-01-10 01:24:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789816398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:24:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:24:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:24:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053613094] [2025-01-10 01:24:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:24:48,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:24:48,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:24:48,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:24:48,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:24:48,249 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-01-10 01:24:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:24:48,307 INFO L93 Difference]: Finished difference Result 145 states and 195 transitions. [2025-01-10 01:24:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:24:48,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2025-01-10 01:24:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:24:48,309 INFO L225 Difference]: With dead ends: 145 [2025-01-10 01:24:48,309 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 01:24:48,309 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-01-10 01:24:48,310 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:24:48,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:24:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 01:24:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-10 01:24:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 75 states have internal predecessors, (99), 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-01-10 01:24:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2025-01-10 01:24:48,318 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 23 [2025-01-10 01:24:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:24:48,319 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2025-01-10 01:24:48,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-01-10 01:24:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2025-01-10 01:24:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:24:48,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:24:48,320 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:24:48,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:24:48,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:24:48,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:24:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1192952579, now seen corresponding path program 1 times [2025-01-10 01:24:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:24:48,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493241163] [2025-01-10 01:24:48,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:24:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:24:48,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:24:48,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:24:48,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:24:48,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:24:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 01:24:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:24:48,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493241163] [2025-01-10 01:24:48,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493241163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:24:48,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:24:48,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:24:48,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619596523] [2025-01-10 01:24:48,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:24:48,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:24:48,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:24:48,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:24:48,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:24:48,389 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-01-10 01:24:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:24:48,416 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2025-01-10 01:24:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:24:48,416 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), 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 29 [2025-01-10 01:24:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:24:48,417 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:24:48,417 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 01:24:48,417 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-01-10 01:24:48,418 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:24:48,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 57 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:24:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 01:24:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 01:24:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 72 states have internal predecessors, (96), 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-01-10 01:24:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2025-01-10 01:24:48,427 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 29 [2025-01-10 01:24:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:24:48,427 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2025-01-10 01:24:48,427 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), 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-01-10 01:24:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2025-01-10 01:24:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:24:48,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:24:48,428 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:24:48,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:24:48,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:24:48,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:24:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1673175845, now seen corresponding path program 1 times [2025-01-10 01:24:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:24:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236586010] [2025-01-10 01:24:48,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:24:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:24:48,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:24:48,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:24:48,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:24:48,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:24:48,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:24:48,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:24:48,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:24:48,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:24:48,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:24:48,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:24:48,483 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:24:48,484 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 01:24:48,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 01:24:48,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 01:24:48,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 01:24:48,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 01:24:48,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 01:24:48,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:24:48,488 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:24:48,511 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:24:48,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:24:48 BoogieIcfgContainer [2025-01-10 01:24:48,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:24:48,515 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:24:48,515 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:24:48,515 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:24:48,516 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:24:47" (3/4) ... [2025-01-10 01:24:48,516 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 01:24:48,574 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 24. [2025-01-10 01:24:48,643 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:24:48,643 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:24:48,643 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:24:48,644 INFO L158 Benchmark]: Toolchain (without parser) took 1939.58ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 121.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2025-01-10 01:24:48,644 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:24:48,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.88ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 122.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:24:48,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.81ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 121.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:24:48,645 INFO L158 Benchmark]: Boogie Preprocessor took 26.77ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 119.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:24:48,645 INFO L158 Benchmark]: RCFGBuilder took 281.74ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 105.0MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:24:48,646 INFO L158 Benchmark]: TraceAbstraction took 1241.83ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 128.0MB in the end (delta: -23.6MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2025-01-10 01:24:48,647 INFO L158 Benchmark]: Witness Printer took 128.45ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 121.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:24:48,649 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.88ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 122.4MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.81ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 121.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.77ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 119.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 281.74ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 105.0MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1241.83ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 128.0MB in the end (delta: -23.6MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Witness Printer took 128.45ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 121.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L21] int s__state ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__verify_mode = __VERIFIER_nondet_int() ; [L24] int s__session__peer = __VERIFIER_nondet_int() ; [L25] unsigned long s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_long() ; [L26] int buf ; [L27] int cb ; [L28] int blastFlag ; [L29] int tmp___1; [L31] s__state = 8466 [L32] blastFlag = 0 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8466, s__verify_mode=2147483647] [L41] COND TRUE s__state == 8466 VAL [blastFlag=0, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L90] COND TRUE blastFlag == 0 [L91] blastFlag = 1 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L93] s__state = 8496 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8496, s__verify_mode=2147483647] [L44] COND TRUE s__state == 8496 VAL [blastFlag=1, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L97] COND TRUE blastFlag == 1 [L98] blastFlag = 2 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L100] COND FALSE !(\read(s__hit)) [L103] s__state = 8512 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8512, s__verify_mode=2147483647] [L48] COND TRUE s__state == 8512 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L108] s__state = 8528 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L48] COND FALSE !(s__state == 8512) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8528, s__verify_mode=2147483647] [L52] COND TRUE s__state == 8528 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L112] s__state = 8544 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L35] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L41] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L44] COND FALSE !(s__state == 8496) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L48] COND FALSE !(s__state == 8512) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L52] COND FALSE !(s__state == 8528) VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__state=8544, s__verify_mode=2147483647] [L56] COND TRUE s__state == 8544 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0, s__verify_mode=2147483647] [L116] s__verify_mode + 1 VAL [blastFlag=2, s__hit=0, s__s3__tmp__new_cipher__algorithms=0, s__session__peer=0] - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 126]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 581 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 415 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 252 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 62/62 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-10 01:24:48,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)