./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 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/openssl-simplified/s3_srvr_1a.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:42:41,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:42:41,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:42:41,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:42:41,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:42:41,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:42:41,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:42:41,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:42:41,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:42:41,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:42:41,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:42:41,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:42:41,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:42:41,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:42:41,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:42:41,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:42:41,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:42:41,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:42:41,388 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bbd8ebbfdd1aa7b2aaa2f32f767526fd317d11dcf6b707f4c34423040b4383f [2025-03-17 14:42:41,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:42:41,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:42:41,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:42:41,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:42:41,610 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:42:41,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2025-03-17 14:42:42,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea789469/ea38e6c226444f3e8ff64a0699a0a11d/FLAGc4b9dac50 [2025-03-17 14:42:42,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:42:42,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1a.cil.c [2025-03-17 14:42:42,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea789469/ea38e6c226444f3e8ff64a0699a0a11d/FLAGc4b9dac50 [2025-03-17 14:42:43,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea789469/ea38e6c226444f3e8ff64a0699a0a11d [2025-03-17 14:42:43,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:42:43,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:42:43,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:42:43,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:42:43,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:42:43,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4217ed76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43, skipping insertion in model container [2025-03-17 14:42:43,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:42:43,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:42:43,434 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:42:43,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:42:43,465 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:42:43,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43 WrapperNode [2025-03-17 14:42:43,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:42:43,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:42:43,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:42:43,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:42:43,471 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:42:43" (1/1) ... [2025-03-17 14:42:43,475 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:42:43" (1/1) ... [2025-03-17 14:42:43,487 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 147 [2025-03-17 14:42:43,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:42:43,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:42:43,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:42:43,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:42:43,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,499 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-03-17 14:42:43,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:42:43,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:42:43,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:42:43,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:42:43,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (1/1) ... [2025-03-17 14:42:43,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:42:43,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:43,544 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:42:43,546 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:42:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:42:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:42:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:42:43,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:42:43,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:42:43,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:42:43,766 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-17 14:42:43,766 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:42:43,773 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:42:43,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:42:43,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:42:43 BoogieIcfgContainer [2025-03-17 14:42:43,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:42:43,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:42:43,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:42:43,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:42:43,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:42:43" (1/3) ... [2025-03-17 14:42:43,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302e4eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:42:43, skipping insertion in model container [2025-03-17 14:42:43,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:42:43" (2/3) ... [2025-03-17 14:42:43,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302e4eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:42:43, skipping insertion in model container [2025-03-17 14:42:43,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:42:43" (3/3) ... [2025-03-17 14:42:43,779 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2025-03-17 14:42:43,789 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:42:43,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_1a.cil.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-17 14:42:43,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:42:43,837 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;@7e586468, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:42:43,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:42:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 54 states have internal predecessors, (83), 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:42:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:42:43,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:43,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:43,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:42:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1151750306, now seen corresponding path program 1 times [2025-03-17 14:42:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:43,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928834056] [2025-03-17 14:42:43,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:43,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:43,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:42:43,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:42:43,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:43,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:43,979 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:42:43,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:43,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928834056] [2025-03-17 14:42:43,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928834056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:43,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:43,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:42:43,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19194994] [2025-03-17 14:42:43,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:43,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:42:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:44,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:42:44,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:42:44,002 INFO L87 Difference]: Start difference. First operand has 55 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 54 states have internal predecessors, (83), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:42:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:44,082 INFO L93 Difference]: Finished difference Result 111 states and 170 transitions. [2025-03-17 14:42:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:42:44,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 14:42:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:44,088 INFO L225 Difference]: With dead ends: 111 [2025-03-17 14:42:44,088 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 14:42:44,090 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-03-17 14:42:44,091 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 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-03-17 14:42:44,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:42:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 14:42:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 14:42:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 51 states have internal predecessors, (75), 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:42:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-17 14:42:44,113 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 8 [2025-03-17 14:42:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:44,113 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-17 14:42:44,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:42:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-03-17 14:42:44,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:42:44,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:44,114 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:44,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:42:44,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:42:44,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash -876070365, now seen corresponding path program 1 times [2025-03-17 14:42:44,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:44,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406723679] [2025-03-17 14:42:44,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:44,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:44,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:42:44,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:42:44,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:44,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:42:44,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:44,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406723679] [2025-03-17 14:42:44,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406723679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:44,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:44,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:42:44,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144243289] [2025-03-17 14:42:44,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:44,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:42:44,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:44,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:42:44,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:42:44,154 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:42:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:44,214 INFO L93 Difference]: Finished difference Result 106 states and 154 transitions. [2025-03-17 14:42:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:42:44,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-03-17 14:42:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:44,215 INFO L225 Difference]: With dead ends: 106 [2025-03-17 14:42:44,216 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 14:42:44,216 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-03-17 14:42:44,217 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 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-03-17 14:42:44,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:42:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 14:42:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 14:42:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:42:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2025-03-17 14:42:44,221 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 12 [2025-03-17 14:42:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:44,221 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-03-17 14:42:44,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:42:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2025-03-17 14:42:44,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:42:44,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:44,222 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:44,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:42:44,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:42:44,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1273419889, now seen corresponding path program 1 times [2025-03-17 14:42:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988422013] [2025-03-17 14:42:44,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:44,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:42:44,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:42:44,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:44,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:42:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:44,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988422013] [2025-03-17 14:42:44,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988422013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:44,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:42:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102240474] [2025-03-17 14:42:44,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:44,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:42:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:44,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:42:44,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:42:44,267 INFO L87 Difference]: Start difference. First operand 55 states and 78 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-03-17 14:42:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:44,292 INFO L93 Difference]: Finished difference Result 114 states and 161 transitions. [2025-03-17 14:42:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:42:44,292 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 17 [2025-03-17 14:42:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:44,293 INFO L225 Difference]: With dead ends: 114 [2025-03-17 14:42:44,293 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 14:42:44,294 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-03-17 14:42:44,294 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:44,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 14:42:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 14:42:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.537037037037037) internal successors, (83), 59 states have internal predecessors, (83), 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:42:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2025-03-17 14:42:44,302 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 17 [2025-03-17 14:42:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:44,302 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2025-03-17 14:42:44,302 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-03-17 14:42:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2025-03-17 14:42:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:42:44,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:44,302 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:44,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:42:44,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:42:44,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:44,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1214092944, now seen corresponding path program 1 times [2025-03-17 14:42:44,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:44,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412257413] [2025-03-17 14:42:44,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:44,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:42:44,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:42:44,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:44,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:42:44,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:44,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412257413] [2025-03-17 14:42:44,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412257413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:44,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:44,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:42:44,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323597443] [2025-03-17 14:42:44,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:44,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:42:44,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:44,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:42:44,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:42:44,361 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:42:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:44,430 INFO L93 Difference]: Finished difference Result 132 states and 189 transitions. [2025-03-17 14:42:44,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:42:44,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 17 [2025-03-17 14:42:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:44,431 INFO L225 Difference]: With dead ends: 132 [2025-03-17 14:42:44,431 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 14:42:44,431 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-03-17 14:42:44,432 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 92 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-03-17 14:42:44,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 92 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:42:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 14:42:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-03-17 14:42:44,437 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-03-17 14:42:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2025-03-17 14:42:44,437 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 17 [2025-03-17 14:42:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:44,437 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2025-03-17 14:42:44,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:42:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2025-03-17 14:42:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:42:44,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:44,438 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:44,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:42:44,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:42:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash 528717391, now seen corresponding path program 1 times [2025-03-17 14:42:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388798025] [2025-03-17 14:42:44,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:44,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:42:44,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:42:44,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:44,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:42:44,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388798025] [2025-03-17 14:42:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388798025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:44,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:44,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:42:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862187618] [2025-03-17 14:42:44,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:44,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:42:44,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:44,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:42:44,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:42:44,490 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:42:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:44,543 INFO L93 Difference]: Finished difference Result 145 states and 194 transitions. [2025-03-17 14:42:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:42:44,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 17 [2025-03-17 14:42:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:44,544 INFO L225 Difference]: With dead ends: 145 [2025-03-17 14:42:44,545 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:42:44,546 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-03-17 14:42:44,546 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:44,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:42:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 14:42:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 74 states have internal predecessors, (98), 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:42:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2025-03-17 14:42:44,558 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 17 [2025-03-17 14:42:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:44,558 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2025-03-17 14:42:44,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:42:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2025-03-17 14:42:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:42:44,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:44,558 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:44,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:42:44,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:42:44,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:44,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1760278334, now seen corresponding path program 1 times [2025-03-17 14:42:44,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:44,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173012599] [2025-03-17 14:42:44,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:44,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:44,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:42:44,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:42:44,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:44,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:42:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173012599] [2025-03-17 14:42:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173012599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:42:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548827210] [2025-03-17 14:42:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:44,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:42:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:44,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:42:44,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:42:44,605 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) 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-03-17 14:42:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:44,660 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2025-03-17 14:42:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:42:44,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) 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 22 [2025-03-17 14:42:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:44,661 INFO L225 Difference]: With dead ends: 154 [2025-03-17 14:42:44,661 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 14:42:44,661 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-03-17 14:42:44,662 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 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-03-17 14:42:44,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:42:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 14:42:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 14:42:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 79 states have internal predecessors, (103), 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:42:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2025-03-17 14:42:44,666 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 22 [2025-03-17 14:42:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:44,666 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2025-03-17 14:42:44,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) 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-03-17 14:42:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2025-03-17 14:42:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 14:42:44,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:44,667 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:44,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:42:44,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:42:44,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash -524714944, now seen corresponding path program 1 times [2025-03-17 14:42:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:44,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177979405] [2025-03-17 14:42:44,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:44,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:42:44,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:42:44,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:44,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 14:42:44,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:44,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177979405] [2025-03-17 14:42:44,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177979405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:44,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:44,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:42:44,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151975662] [2025-03-17 14:42:44,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:44,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:42:44,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:44,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:42:44,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:42:44,722 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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:42:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:44,740 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2025-03-17 14:42:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:42:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 28 [2025-03-17 14:42:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:44,741 INFO L225 Difference]: With dead ends: 80 [2025-03-17 14:42:44,741 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 14:42:44,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03-17 14:42:44,742 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 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-03-17 14:42:44,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 14:42:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 14:42:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 76 states have internal predecessors, (100), 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:42:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2025-03-17 14:42:44,750 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 28 [2025-03-17 14:42:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:44,750 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2025-03-17 14:42:44,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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:42:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2025-03-17 14:42:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:42:44,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:44,751 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-03-17 14:42:44,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:42:44,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:42:44,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash 913705958, now seen corresponding path program 1 times [2025-03-17 14:42:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:44,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870391350] [2025-03-17 14:42:44,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:44,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:44,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:42:44,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:42:44,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:44,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:42:44,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:42:44,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:42:44,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:42:44,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:44,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:42:44,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:42:44,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:42:44,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 14:42:44,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 14:42:44,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 14:42:44,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 14:42:44,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 14:42:44,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 14:42:44,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:42:44,781 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:44,801 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:42:44,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:42:44 BoogieIcfgContainer [2025-03-17 14:42:44,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:42:44,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:42:44,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:42:44,804 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:42:44,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:42:43" (3/4) ... [2025-03-17 14:42:44,805 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 14:42:44,843 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 24. [2025-03-17 14:42:44,881 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:42:44,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:42:44,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:42:44,882 INFO L158 Benchmark]: Toolchain (without parser) took 1582.70ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 104.6MB in the end (delta: 19.1MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2025-03-17 14:42:44,882 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:42:44,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.57ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 112.7MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:42:44,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.75ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 111.0MB in the end (delta: 847.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:42:44,883 INFO L158 Benchmark]: Boogie Preprocessor took 22.66ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:42:44,883 INFO L158 Benchmark]: IcfgBuilder took 262.54ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 93.9MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:42:44,883 INFO L158 Benchmark]: TraceAbstraction took 1028.34ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 111.3MB in the end (delta: -18.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:42:44,883 INFO L158 Benchmark]: Witness Printer took 78.02ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 104.6MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:42:44,884 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.03ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.57ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 112.7MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.75ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 111.0MB in the end (delta: 847.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.66ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.9MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 262.54ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 93.9MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1028.34ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 111.3MB in the end (delta: -18.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 78.02ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 104.6MB in the end (delta: 6.7MB). 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: 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. - UnprovableResult [Line: 116]: 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, 55 locations, 83 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 701 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 481 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=6, InterpolantAutomatonStates: 21, 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, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 69/69 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-03-17 14:42:44,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)