./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:44:12,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:44:12,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:44:12,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:44:12,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:44:12,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:44:12,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:44:12,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:44:12,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:44:12,983 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:44:12,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:44:12,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:44:12,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:44:12,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:44:12,984 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:44:12,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:44:12,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:44:12,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:44:12,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:44:12,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:44:12,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:44:12,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:44:12,985 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:44:12,985 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:44:12,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:44:12,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:44:12,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:44:12,986 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:44:12,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:44:12,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:44:12,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:44:12,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:44:12,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:44:12,987 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b [2025-03-17 14:44:13,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:44:13,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:44:13,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:44:13,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:44:13,215 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:44:13,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2025-03-17 14:44:14,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d83738b7/30e82b97ce8e4a60912e151345844ff1/FLAG8aa7089be [2025-03-17 14:44:14,574 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:44:14,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2025-03-17 14:44:14,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d83738b7/30e82b97ce8e4a60912e151345844ff1/FLAG8aa7089be [2025-03-17 14:44:14,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d83738b7/30e82b97ce8e4a60912e151345844ff1 [2025-03-17 14:44:14,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:44:14,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:44:14,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:44:14,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:44:14,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:44:14,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:44:14" (1/1) ... [2025-03-17 14:44:14,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:14, skipping insertion in model container [2025-03-17 14:44:14,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:44:14" (1/1) ... [2025-03-17 14:44:14,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:44:15,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:44:15,036 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:44:15,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:44:15,054 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:44:15,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15 WrapperNode [2025-03-17 14:44:15,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:44:15,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:44:15,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:44:15,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:44:15,061 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:44:15" (1/1) ... [2025-03-17 14:44:15,064 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:44:15" (1/1) ... [2025-03-17 14:44:15,074 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2025-03-17 14:44:15,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:44:15,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:44:15,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:44:15,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:44:15,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,086 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:44:15,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:44:15,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:44:15,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:44:15,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:44:15,096 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (1/1) ... [2025-03-17 14:44:15,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:44:15,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:15,124 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:44:15,127 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:44:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2025-03-17 14:44:15,147 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2025-03-17 14:44:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2025-03-17 14:44:15,148 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2025-03-17 14:44:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:44:15,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:44:15,184 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:44:15,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:44:15,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; [2025-03-17 14:44:15,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret3;havoc #t~ret4; [2025-03-17 14:44:15,284 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 14:44:15,285 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:44:15,292 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:44:15,292 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:44:15,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:44:15 BoogieIcfgContainer [2025-03-17 14:44:15,293 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:44:15,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:44:15,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:44:15,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:44:15,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:44:14" (1/3) ... [2025-03-17 14:44:15,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0a0052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:44:15, skipping insertion in model container [2025-03-17 14:44:15,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:44:15" (2/3) ... [2025-03-17 14:44:15,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0a0052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:44:15, skipping insertion in model container [2025-03-17 14:44:15,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:44:15" (3/3) ... [2025-03-17 14:44:15,299 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2025-03-17 14:44:15,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:44:15,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_1d.c that has 3 procedures, 43 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-17 14:44:15,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:44:15,353 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;@11abc3c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:44:15,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 14:44:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.5) internal successors, (36), 34 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:44:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 14:44:15,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:15,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:15,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:15,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:15,365 INFO L85 PathProgramCache]: Analyzing trace with hash 180342059, now seen corresponding path program 1 times [2025-03-17 14:44:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:15,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773320515] [2025-03-17 14:44:15,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:15,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:44:15,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:44:15,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:15,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:15,471 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:44:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773320515] [2025-03-17 14:44:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773320515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112192748] [2025-03-17 14:44:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:15,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:15,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:15,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:15,490 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.5) internal successors, (36), 34 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:15,518 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-03-17 14:44:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:15,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 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:44:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:15,526 INFO L225 Difference]: With dead ends: 45 [2025-03-17 14:44:15,526 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 14:44:15,528 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:44:15,532 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:15,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 14:44:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-17 14:44:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 14:44:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-17 14:44:15,561 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 8 [2025-03-17 14:44:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:15,561 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-17 14:44:15,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-17 14:44:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:44:15,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:15,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:15,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:44:15,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:15,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1295636518, now seen corresponding path program 1 times [2025-03-17 14:44:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:15,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980309658] [2025-03-17 14:44:15,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:15,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:44:15,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:44:15,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:15,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:15,658 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:44:15,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:15,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980309658] [2025-03-17 14:44:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980309658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:15,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:15,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:15,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908758615] [2025-03-17 14:44:15,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:15,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:44:15,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:15,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:44:15,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:44:15,660 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:15,780 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2025-03-17 14:44:15,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:44:15,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 14:44:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:15,782 INFO L225 Difference]: With dead ends: 80 [2025-03-17 14:44:15,782 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:44:15,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:44:15,782 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:15,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 222 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:44:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2025-03-17 14:44:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 14:44:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2025-03-17 14:44:15,794 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2025-03-17 14:44:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:15,794 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2025-03-17 14:44:15,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2025-03-17 14:44:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:44:15,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:15,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:15,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:44:15,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:15,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash -434559964, now seen corresponding path program 1 times [2025-03-17 14:44:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:15,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686292925] [2025-03-17 14:44:15,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:15,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:44:15,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:44:15,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:15,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:15,843 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:44:15,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:15,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686292925] [2025-03-17 14:44:15,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686292925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:15,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:15,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:44:15,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973187727] [2025-03-17 14:44:15,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:15,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:44:15,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:15,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:44:15,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:15,845 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:15,876 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2025-03-17 14:44:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:44:15,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 14:44:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:15,878 INFO L225 Difference]: With dead ends: 86 [2025-03-17 14:44:15,878 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 14:44:15,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:15,879 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:15,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 14:44:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2025-03-17 14:44:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 56 states have internal predecessors, (67), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 14:44:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2025-03-17 14:44:15,893 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 11 [2025-03-17 14:44:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:15,893 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2025-03-17 14:44:15,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2025-03-17 14:44:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:44:15,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:15,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:15,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:44:15,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:15,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash -586456996, now seen corresponding path program 1 times [2025-03-17 14:44:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:15,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107364030] [2025-03-17 14:44:15,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:15,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:44:15,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:44:15,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:15,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:15,918 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:44:15,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:15,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107364030] [2025-03-17 14:44:15,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107364030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:15,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:15,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:15,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391940464] [2025-03-17 14:44:15,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:15,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:15,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:15,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:15,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:15,921 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:15,933 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2025-03-17 14:44:15,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:15,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 14:44:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:15,934 INFO L225 Difference]: With dead ends: 73 [2025-03-17 14:44:15,934 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 14:44:15,935 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:44:15,937 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:15,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 14:44:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 14:44:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 55 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 14:44:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2025-03-17 14:44:15,952 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 12 [2025-03-17 14:44:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:15,952 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2025-03-17 14:44:15,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2025-03-17 14:44:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 14:44:15,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:15,953 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:15,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:44:15,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:15,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash 572915139, now seen corresponding path program 1 times [2025-03-17 14:44:15,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:15,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538887662] [2025-03-17 14:44:15,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:15,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:15,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:44:15,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:44:15,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:15,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538887662] [2025-03-17 14:44:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538887662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:44:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037756080] [2025-03-17 14:44:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:44:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:44:16,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:16,009 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,037 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2025-03-17 14:44:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:44:16,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 14:44:16,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,039 INFO L225 Difference]: With dead ends: 93 [2025-03-17 14:44:16,039 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 14:44:16,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:16,041 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 14:44:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2025-03-17 14:44:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 57 states have internal predecessors, (69), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 14:44:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2025-03-17 14:44:16,054 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2025-03-17 14:44:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,055 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2025-03-17 14:44:16,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2025-03-17 14:44:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:44:16,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,055 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:44:16,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash 580500104, now seen corresponding path program 1 times [2025-03-17 14:44:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692832215] [2025-03-17 14:44:16,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:44:16,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:44:16,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692832215] [2025-03-17 14:44:16,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692832215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810634329] [2025-03-17 14:44:16,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:16,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:16,099 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,111 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2025-03-17 14:44:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-17 14:44:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,113 INFO L225 Difference]: With dead ends: 76 [2025-03-17 14:44:16,113 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 14:44:16,113 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:44:16,114 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 14:44:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 14:44:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 56 states have internal predecessors, (67), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 14:44:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2025-03-17 14:44:16,124 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 17 [2025-03-17 14:44:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,124 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-03-17 14:44:16,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2025-03-17 14:44:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:44:16,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,126 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:44:16,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1716590880, now seen corresponding path program 1 times [2025-03-17 14:44:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860301771] [2025-03-17 14:44:16,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:44:16,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:44:16,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860301771] [2025-03-17 14:44:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860301771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:44:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107298407] [2025-03-17 14:44:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:44:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:44:16,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:16,165 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,185 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2025-03-17 14:44:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:44:16,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-17 14:44:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,189 INFO L225 Difference]: With dead ends: 84 [2025-03-17 14:44:16,189 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 14:44:16,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:16,189 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 14:44:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-03-17 14:44:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.263157894736842) internal successors, (72), 60 states have internal predecessors, (72), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (20), 16 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-17 14:44:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-03-17 14:44:16,199 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 19 [2025-03-17 14:44:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,199 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-03-17 14:44:16,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-03-17 14:44:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:44:16,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:44:16,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1714442940, now seen corresponding path program 1 times [2025-03-17 14:44:16,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916825466] [2025-03-17 14:44:16,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:44:16,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:44:16,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:44:16,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916825466] [2025-03-17 14:44:16,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916825466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:16,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759170832] [2025-03-17 14:44:16,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:44:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:44:16,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:44:16,242 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,288 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2025-03-17 14:44:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:44:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-17 14:44:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,289 INFO L225 Difference]: With dead ends: 131 [2025-03-17 14:44:16,289 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 14:44:16,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:44:16,290 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 104 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 14:44:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 14:44:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 58 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 14:44:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2025-03-17 14:44:16,302 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 20 [2025-03-17 14:44:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,302 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2025-03-17 14:44:16,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2025-03-17 14:44:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:44:16,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,302 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:44:16,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,303 INFO L85 PathProgramCache]: Analyzing trace with hash -480586747, now seen corresponding path program 1 times [2025-03-17 14:44:16,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-03-17 14:44:16,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:44:16,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:44:16,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:44:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-03-17 14:44:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911687258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031797271] [2025-03-17 14:44:16,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:16,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:16,358 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,401 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2025-03-17 14:44:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:44:16,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-17 14:44:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,403 INFO L225 Difference]: With dead ends: 160 [2025-03-17 14:44:16,403 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 14:44:16,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:44:16,404 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 14:44:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2025-03-17 14:44:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 65 states have internal predecessors, (73), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 14 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-17 14:44:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2025-03-17 14:44:16,411 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 22 [2025-03-17 14:44:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,412 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2025-03-17 14:44:16,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:44:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2025-03-17 14:44:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 14:44:16,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,412 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:44:16,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1292504350, now seen corresponding path program 1 times [2025-03-17 14:44:16,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087473495] [2025-03-17 14:44:16,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:44:16,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:44:16,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:44:16,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087473495] [2025-03-17 14:44:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087473495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:16,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691569973] [2025-03-17 14:44:16,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:16,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:16,481 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,531 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2025-03-17 14:44:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:44:16,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-17 14:44:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,533 INFO L225 Difference]: With dead ends: 170 [2025-03-17 14:44:16,533 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 14:44:16,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:44:16,534 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 190 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 14:44:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2025-03-17 14:44:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 70 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-17 14:44:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2025-03-17 14:44:16,542 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 33 [2025-03-17 14:44:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,542 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2025-03-17 14:44:16,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:44:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2025-03-17 14:44:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 14:44:16,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,543 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:44:16,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,543 INFO L85 PathProgramCache]: Analyzing trace with hash 850385268, now seen corresponding path program 1 times [2025-03-17 14:44:16,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024304565] [2025-03-17 14:44:16,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:44:16,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:44:16,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-17 14:44:16,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024304565] [2025-03-17 14:44:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024304565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539255185] [2025-03-17 14:44:16,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:16,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:16,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:16,572 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,581 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2025-03-17 14:44:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-03-17 14:44:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,583 INFO L225 Difference]: With dead ends: 93 [2025-03-17 14:44:16,586 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 14:44:16,587 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:44:16,587 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 14:44:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 14:44:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 69 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 16 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-17 14:44:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2025-03-17 14:44:16,595 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 35 [2025-03-17 14:44:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,595 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2025-03-17 14:44:16,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2025-03-17 14:44:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 14:44:16,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,595 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:44:16,596 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1344689876, now seen corresponding path program 1 times [2025-03-17 14:44:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610478395] [2025-03-17 14:44:16,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:44:16,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:44:16,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:44:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610478395] [2025-03-17 14:44:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610478395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:44:16,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251025871] [2025-03-17 14:44:16,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:44:16,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:44:16,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:16,623 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,637 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2025-03-17 14:44:16,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:44:16,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-17 14:44:16,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,638 INFO L225 Difference]: With dead ends: 99 [2025-03-17 14:44:16,638 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 14:44:16,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:44:16,638 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 14:44:16,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 14:44:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 73 states have internal predecessors, (82), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 18 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-17 14:44:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2025-03-17 14:44:16,657 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 31 [2025-03-17 14:44:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,657 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2025-03-17 14:44:16,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:44:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2025-03-17 14:44:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 14:44:16,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,660 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:44:16,661 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,661 INFO L85 PathProgramCache]: Analyzing trace with hash 819316549, now seen corresponding path program 1 times [2025-03-17 14:44:16,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365359354] [2025-03-17 14:44:16,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 14:44:16,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 14:44:16,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-17 14:44:16,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365359354] [2025-03-17 14:44:16,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365359354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:16,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571373897] [2025-03-17 14:44:16,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:16,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:16,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:16,733 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,770 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2025-03-17 14:44:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:44:16,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2025-03-17 14:44:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,772 INFO L225 Difference]: With dead ends: 108 [2025-03-17 14:44:16,772 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 14:44:16,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:44:16,773 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 14:44:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2025-03-17 14:44:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 72 states have internal predecessors, (80), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 18 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-17 14:44:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2025-03-17 14:44:16,785 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 45 [2025-03-17 14:44:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,786 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-03-17 14:44:16,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2025-03-17 14:44:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 14:44:16,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,787 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:44:16,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1799743241, now seen corresponding path program 1 times [2025-03-17 14:44:16,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704869239] [2025-03-17 14:44:16,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:44:16,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:44:16,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:44:16,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704869239] [2025-03-17 14:44:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704869239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:16,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:16,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:44:16,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057773489] [2025-03-17 14:44:16,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:16,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:44:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:16,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:44:16,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:16,842 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:16,863 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2025-03-17 14:44:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:44:16,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-03-17 14:44:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:16,864 INFO L225 Difference]: With dead ends: 97 [2025-03-17 14:44:16,864 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 14:44:16,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:44:16,864 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:16,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 14:44:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 14:44:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 71 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (22), 18 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-17 14:44:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2025-03-17 14:44:16,873 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 35 [2025-03-17 14:44:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:16,873 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2025-03-17 14:44:16,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2025-03-17 14:44:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 14:44:16,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:16,875 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:16,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:44:16,875 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:16,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1808141305, now seen corresponding path program 1 times [2025-03-17 14:44:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:16,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124100459] [2025-03-17 14:44:16,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:16,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:44:16,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:44:16,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:16,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-17 14:44:16,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124100459] [2025-03-17 14:44:16,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124100459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864784557] [2025-03-17 14:44:16,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:16,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:16,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:16,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:16,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:44:17,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:44:17,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:44:17,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:17,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:17,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:44:17,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-17 14:44:17,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-17 14:44:17,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864784557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:17,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:17,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 14:44:17,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579304753] [2025-03-17 14:44:17,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:17,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:44:17,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:17,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:44:17,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:44:17,183 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 14:44:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:17,420 INFO L93 Difference]: Finished difference Result 213 states and 261 transitions. [2025-03-17 14:44:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:44:17,420 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2025-03-17 14:44:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:17,421 INFO L225 Difference]: With dead ends: 213 [2025-03-17 14:44:17,422 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 14:44:17,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:44:17,423 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:17,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 248 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:44:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 14:44:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2025-03-17 14:44:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 78 states have internal predecessors, (84), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (18), 18 states have call predecessors, (18), 16 states have call successors, (18) [2025-03-17 14:44:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2025-03-17 14:44:17,431 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 51 [2025-03-17 14:44:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:17,432 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2025-03-17 14:44:17,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 14:44:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2025-03-17 14:44:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 14:44:17,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:17,436 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:17,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:44:17,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:44:17,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:17,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash 535822711, now seen corresponding path program 1 times [2025-03-17 14:44:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:17,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181813688] [2025-03-17 14:44:17,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:17,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:17,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 14:44:17,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 14:44:17,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:17,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:44:17,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181813688] [2025-03-17 14:44:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181813688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:44:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667705494] [2025-03-17 14:44:17,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:17,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:44:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:44:17,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:44:17,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:44:17,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 14:44:17,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 14:44:17,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:17,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:17,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:44:17,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:44:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:44:17,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:44:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:44:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667705494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:44:17,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:44:17,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-03-17 14:44:17,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349692059] [2025-03-17 14:44:17,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:44:17,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:44:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:17,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:44:17,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:44:17,846 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:17,880 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2025-03-17 14:44:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:44:17,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2025-03-17 14:44:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:17,881 INFO L225 Difference]: With dead ends: 121 [2025-03-17 14:44:17,881 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 14:44:17,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:44:17,882 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:17,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 14:44:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-03-17 14:44:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 14:44:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-17 14:44:17,886 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 44 [2025-03-17 14:44:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:17,886 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-17 14:44:17,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:44:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-17 14:44:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 14:44:17,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:44:17,886 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:17,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:44:18,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:44:18,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:44:18,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:44:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash 496089493, now seen corresponding path program 1 times [2025-03-17 14:44:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:44:18,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935505253] [2025-03-17 14:44:18,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:44:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:44:18,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 14:44:18,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 14:44:18,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:44:18,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:44:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 14:44:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:44:18,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935505253] [2025-03-17 14:44:18,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935505253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:44:18,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:44:18,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:44:18,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634670135] [2025-03-17 14:44:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:44:18,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:44:18,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:44:18,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:44:18,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:44:18,126 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:44:18,130 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-03-17 14:44:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:44:18,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2025-03-17 14:44:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:44:18,131 INFO L225 Difference]: With dead ends: 57 [2025-03-17 14:44:18,131 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:44:18,131 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:44:18,131 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:44:18,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:44:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:44:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:44:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:44:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:44:18,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2025-03-17 14:44:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:44:18,133 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:44:18,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 14:44:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:44:18,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:44:18,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-17 14:44:18,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-17 14:44:18,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-17 14:44:18,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-17 14:44:18,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-17 14:44:18,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-17 14:44:18,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-17 14:44:18,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-17 14:44:18,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-17 14:44:18,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-17 14:44:18,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:44:18,139 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:44:18,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:44:18,465 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:44:18,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:44:18 BoogieIcfgContainer [2025-03-17 14:44:18,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:44:18,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:44:18,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:44:18,470 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:44:18,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:44:15" (3/4) ... [2025-03-17 14:44:18,471 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:44:18,475 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec1 [2025-03-17 14:44:18,475 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec2 [2025-03-17 14:44:18,477 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 14:44:18,478 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:44:18,478 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 14:44:18,525 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:44:18,525 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:44:18,525 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:44:18,526 INFO L158 Benchmark]: Toolchain (without parser) took 3599.38ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 87.2MB in the end (delta: 18.3MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-03-17 14:44:18,526 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 192.9MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:44:18,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 128.97ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 95.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:44:18,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.97ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.5MB in the end (delta: 939.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:44:18,526 INFO L158 Benchmark]: Boogie Preprocessor took 15.16ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 987.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:44:18,527 INFO L158 Benchmark]: IcfgBuilder took 199.25ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 81.9MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:44:18,527 INFO L158 Benchmark]: TraceAbstraction took 3175.00ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 93.5MB in the end (delta: -12.1MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2025-03-17 14:44:18,527 INFO L158 Benchmark]: Witness Printer took 55.73ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 87.2MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:44:18,530 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 192.9MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 128.97ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 95.5MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.97ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.5MB in the end (delta: 939.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.16ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 987.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 199.25ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 81.9MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3175.00ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 93.5MB in the end (delta: -12.1MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 55.73ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 87.2MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 54 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 2203 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1544 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 565 IncrementalHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 659 mSDtfsCounter, 565 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 195 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=15, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 98 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 621 ConstructedInterpolants, 0 QuantifiedInterpolants, 945 SizeOfPredicates, 2 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 516/528 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 14:44:18,541 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 Result: TRUE