./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:26:20,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:26:20,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:26:20,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:26:20,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:26:20,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:26:20,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:26:20,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:26:20,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:26:20,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:26:20,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:26:20,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:26:20,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:26:20,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:26:20,989 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:26:20,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:26:20,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:26:20,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:26:20,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:26:20,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:26:20,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:26:20,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:26:20,990 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:26:20,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:26:20,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:26:20,990 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:26:20,990 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:26:20,990 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:26:20,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:26:20,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:26:20,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:26:20,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:26:20,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:26:20,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:26:20,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:26:20,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:26:20,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a [2025-01-10 01:26:21,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:26:21,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:26:21,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:26:21,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:26:21,232 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:26:21,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2025-01-10 01:26:22,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9a7a5e0a/58ebc424bafa4de6ab44e0a8e9b949bc/FLAG91b037ce7 [2025-01-10 01:26:22,666 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:26:22,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2025-01-10 01:26:22,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9a7a5e0a/58ebc424bafa4de6ab44e0a8e9b949bc/FLAG91b037ce7 [2025-01-10 01:26:22,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9a7a5e0a/58ebc424bafa4de6ab44e0a8e9b949bc [2025-01-10 01:26:22,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:26:22,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:26:22,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:26:22,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:26:22,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:26:22,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:26:22" (1/1) ... [2025-01-10 01:26:22,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11af817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:22, skipping insertion in model container [2025-01-10 01:26:22,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:26:22" (1/1) ... [2025-01-10 01:26:23,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:26:23,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:26:23,103 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:26:23,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:26:23,124 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:26:23,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23 WrapperNode [2025-01-10 01:26:23,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:26:23,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:26:23,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:26:23,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:26:23,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,146 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2025-01-10 01:26:23,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:26:23,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:26:23,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:26:23,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:26:23,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,158 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:26:23,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:26:23,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:26:23,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:26:23,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:26:23,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (1/1) ... [2025-01-10 01:26:23,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:26:23,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:23,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:26:23,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:26:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2025-01-10 01:26:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2025-01-10 01:26:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2025-01-10 01:26:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2025-01-10 01:26:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:26:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:26:23,259 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:26:23,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:26:23,363 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-10 01:26:23,364 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:26:23,371 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:26:23,372 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:26:23,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:26:23 BoogieIcfgContainer [2025-01-10 01:26:23,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:26:23,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:26:23,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:26:23,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:26:23,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:26:22" (1/3) ... [2025-01-10 01:26:23,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5d7f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:26:23, skipping insertion in model container [2025-01-10 01:26:23,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:26:23" (2/3) ... [2025-01-10 01:26:23,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5d7f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:26:23, skipping insertion in model container [2025-01-10 01:26:23,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:26:23" (3/3) ... [2025-01-10 01:26:23,380 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1a-2.c [2025-01-10 01:26:23,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:26:23,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_1a-2.c that has 3 procedures, 46 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-01-10 01:26:23,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:26:23,451 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;@7fc654be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:26:23,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:26:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 37 states have internal predecessors, (40), 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-01-10 01:26:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:26:23,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:23,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:23,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:23,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1670154822, now seen corresponding path program 1 times [2025-01-10 01:26:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:23,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900515374] [2025-01-10 01:26:23,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:23,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:26:23,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:26:23,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:23,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:23,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:23,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900515374] [2025-01-10 01:26:23,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900515374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:23,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:23,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:26:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330228906] [2025-01-10 01:26:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:23,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:26:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:23,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:26:23,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:23,601 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 37 states have internal predecessors, (40), 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:23,623 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-01-10 01:26:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:26:23,625 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:26:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:23,629 INFO L225 Difference]: With dead ends: 48 [2025-01-10 01:26:23,630 INFO L226 Difference]: Without dead ends: 43 [2025-01-10 01:26:23,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:23,633 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 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-01-10 01:26:23,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-10 01:26:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-01-10 01:26:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 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-01-10 01:26:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-01-10 01:26:23,662 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 7 [2025-01-10 01:26:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:23,663 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-01-10 01:26:23,663 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-01-10 01:26:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:26:23,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:23,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:23,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:26:23,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:23,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash 235191992, now seen corresponding path program 1 times [2025-01-10 01:26:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:23,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394406069] [2025-01-10 01:26:23,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:23,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:23,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:26:23,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:26:23,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:23,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:23,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394406069] [2025-01-10 01:26:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394406069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:26:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370655775] [2025-01-10 01:26:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:26:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:23,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:26:23,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:26:23,724 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:23,774 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2025-01-10 01:26:23,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:26:23,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:26:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:23,777 INFO L225 Difference]: With dead ends: 60 [2025-01-10 01:26:23,777 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 01:26:23,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:26:23,778 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:23,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 159 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 01:26:23,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2025-01-10 01:26:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.375) internal successors, (44), 40 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:26:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-01-10 01:26:23,786 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 8 [2025-01-10 01:26:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:23,786 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-01-10 01:26:23,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:26:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-01-10 01:26:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:26:23,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:23,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:23,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:26:23,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:23,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash -339708579, now seen corresponding path program 1 times [2025-01-10 01:26:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:23,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986266303] [2025-01-10 01:26:23,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:23,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:23,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:26:23,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:26:23,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:23,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986266303] [2025-01-10 01:26:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986266303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:23,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:26:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894794480] [2025-01-10 01:26:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:23,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:26:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:23,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:26:23,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:23,821 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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-01-10 01:26:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:23,833 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2025-01-10 01:26:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:26:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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 12 [2025-01-10 01:26:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:23,834 INFO L225 Difference]: With dead ends: 53 [2025-01-10 01:26:23,834 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:26:23,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:23,834 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 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-01-10 01:26:23,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:26:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-01-10 01:26:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:26:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-01-10 01:26:23,846 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 12 [2025-01-10 01:26:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:23,846 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-10 01:26:23,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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-01-10 01:26:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-01-10 01:26:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:26:23,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:23,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:23,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:26:23,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:23,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1941031319, now seen corresponding path program 1 times [2025-01-10 01:26:23,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:23,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64932572] [2025-01-10 01:26:23,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:23,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:23,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:26:23,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:26:23,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:23,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:23,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:23,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64932572] [2025-01-10 01:26:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64932572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:23,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:26:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133728446] [2025-01-10 01:26:23,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:23,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:26:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:23,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:26:23,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:26:23,919 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-01-10 01:26:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:24,038 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2025-01-10 01:26:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:26:24,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2025-01-10 01:26:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:24,040 INFO L225 Difference]: With dead ends: 77 [2025-01-10 01:26:24,040 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 01:26:24,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:26:24,041 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:24,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 193 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:26:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 01:26:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2025-01-10 01:26:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 51 states have internal predecessors, (60), 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-01-10 01:26:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2025-01-10 01:26:24,058 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 13 [2025-01-10 01:26:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:24,059 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2025-01-10 01:26:24,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-01-10 01:26:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2025-01-10 01:26:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:26:24,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:24,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:24,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:26:24,061 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:24,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash -915788272, now seen corresponding path program 1 times [2025-01-10 01:26:24,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:24,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295108364] [2025-01-10 01:26:24,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:24,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:26:24,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:26:24,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:24,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:26:24,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:24,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295108364] [2025-01-10 01:26:24,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295108364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:24,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:24,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:26:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061658664] [2025-01-10 01:26:24,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:24,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:26:24,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:24,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:26:24,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:26:24,139 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:24,200 INFO L93 Difference]: Finished difference Result 129 states and 167 transitions. [2025-01-10 01:26:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:26:24,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 2 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 19 [2025-01-10 01:26:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:24,203 INFO L225 Difference]: With dead ends: 129 [2025-01-10 01:26:24,203 INFO L226 Difference]: Without dead ends: 72 [2025-01-10 01:26:24,204 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-01-10 01:26:24,205 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:24,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 106 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-10 01:26:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2025-01-10 01:26:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-10 01:26:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2025-01-10 01:26:24,218 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 19 [2025-01-10 01:26:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:24,218 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2025-01-10 01:26:24,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:26:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2025-01-10 01:26:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:26:24,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:24,219 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:24,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:26:24,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:24,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2142115886, now seen corresponding path program 1 times [2025-01-10 01:26:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105205536] [2025-01-10 01:26:24,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:24,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:26:24,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:26:24,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:24,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105205536] [2025-01-10 01:26:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105205536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:24,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:24,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:26:24,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133540771] [2025-01-10 01:26:24,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:24,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:26:24,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:24,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:26:24,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:26:24,268 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-01-10 01:26:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:24,290 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2025-01-10 01:26:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:26:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 20 [2025-01-10 01:26:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:24,291 INFO L225 Difference]: With dead ends: 91 [2025-01-10 01:26:24,291 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 01:26:24,292 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-01-10 01:26:24,292 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 119 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-01-10 01:26:24,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 119 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 01:26:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2025-01-10 01:26:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 57 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-01-10 01:26:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2025-01-10 01:26:24,310 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 20 [2025-01-10 01:26:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2025-01-10 01:26:24,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-01-10 01:26:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2025-01-10 01:26:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:26:24,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:24,311 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:24,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:26:24,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:24,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1981082982, now seen corresponding path program 1 times [2025-01-10 01:26:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441911043] [2025-01-10 01:26:24,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:24,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:26:24,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:26:24,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:24,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:24,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441911043] [2025-01-10 01:26:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441911043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:24,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:24,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:26:24,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202318326] [2025-01-10 01:26:24,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:24,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:26:24,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:24,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:26:24,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:24,354 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-01-10 01:26:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:24,368 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2025-01-10 01:26:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:26:24,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 21 [2025-01-10 01:26:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:24,369 INFO L225 Difference]: With dead ends: 74 [2025-01-10 01:26:24,370 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 01:26:24,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:24,371 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 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-01-10 01:26:24,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 01:26:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 01:26:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-01-10 01:26:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-01-10 01:26:24,384 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 21 [2025-01-10 01:26:24,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:24,384 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-01-10 01:26:24,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-01-10 01:26:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-01-10 01:26:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:26:24,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:24,385 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:24,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:26:24,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1278041661, now seen corresponding path program 1 times [2025-01-10 01:26:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650603203] [2025-01-10 01:26:24,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:24,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:24,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:26:24,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:26:24,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:24,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:26:24,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:24,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650603203] [2025-01-10 01:26:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650603203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:26:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218765199] [2025-01-10 01:26:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:24,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:26:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:24,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:26:24,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:26:24,455 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-01-10 01:26:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:24,510 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2025-01-10 01:26:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:26:24,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 26 [2025-01-10 01:26:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:24,512 INFO L225 Difference]: With dead ends: 157 [2025-01-10 01:26:24,512 INFO L226 Difference]: Without dead ends: 93 [2025-01-10 01:26:24,514 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-01-10 01:26:24,515 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 189 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-01-10 01:26:24,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 189 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-10 01:26:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2025-01-10 01:26:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 63 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2025-01-10 01:26:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2025-01-10 01:26:24,530 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 26 [2025-01-10 01:26:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:24,530 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2025-01-10 01:26:24,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-01-10 01:26:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2025-01-10 01:26:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 01:26:24,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:24,531 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, 1, 1] [2025-01-10 01:26:24,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:26:24,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2088780501, now seen corresponding path program 1 times [2025-01-10 01:26:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279564712] [2025-01-10 01:26:24,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:24,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:24,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:26:24,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:26:24,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:24,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:26:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279564712] [2025-01-10 01:26:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279564712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:26:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794308203] [2025-01-10 01:26:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:24,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:26:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:24,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:26:24,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:26:24,606 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-01-10 01:26:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:24,647 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2025-01-10 01:26:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:26:24,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 37 [2025-01-10 01:26:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:24,649 INFO L225 Difference]: With dead ends: 169 [2025-01-10 01:26:24,649 INFO L226 Difference]: Without dead ends: 97 [2025-01-10 01:26:24,650 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-01-10 01:26:24,650 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 200 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-01-10 01:26:24,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 200 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-10 01:26:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2025-01-10 01:26:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 68 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-01-10 01:26:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2025-01-10 01:26:24,660 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 37 [2025-01-10 01:26:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:24,660 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2025-01-10 01:26:24,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-01-10 01:26:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2025-01-10 01:26:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:26:24,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:24,660 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, 1, 1, 1] [2025-01-10 01:26:24,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:26:24,661 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:24,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1732759368, now seen corresponding path program 1 times [2025-01-10 01:26:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918238036] [2025-01-10 01:26:24,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:24,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:26:24,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:26:24,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:24,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:26:24,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:24,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918238036] [2025-01-10 01:26:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918238036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:24,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:26:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577103840] [2025-01-10 01:26:24,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:24,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:26:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:24,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:26:24,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:24,700 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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-01-10 01:26:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:24,711 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2025-01-10 01:26:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:26:24,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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 34 [2025-01-10 01:26:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:24,712 INFO L225 Difference]: With dead ends: 89 [2025-01-10 01:26:24,712 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 01:26:24,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:24,713 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 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-01-10 01:26:24,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 01:26:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-10 01:26:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.2) internal successors, (72), 67 states have internal predecessors, (72), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-01-10 01:26:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2025-01-10 01:26:24,725 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 34 [2025-01-10 01:26:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:24,725 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2025-01-10 01:26:24,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (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-01-10 01:26:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2025-01-10 01:26:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 01:26:24,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:24,726 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, 1, 1, 1, 1] [2025-01-10 01:26:24,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:26:24,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:24,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2119034492, now seen corresponding path program 1 times [2025-01-10 01:26:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:24,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131467968] [2025-01-10 01:26:24,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:24,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:24,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:26:24,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:26:24,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:24,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:26:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131467968] [2025-01-10 01:26:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131467968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:24,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:26:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187172008] [2025-01-10 01:26:24,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:24,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:26:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:24,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:26:24,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:26:24,766 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-01-10 01:26:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:24,782 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2025-01-10 01:26:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:26:24,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 35 [2025-01-10 01:26:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:24,783 INFO L225 Difference]: With dead ends: 95 [2025-01-10 01:26:24,783 INFO L226 Difference]: Without dead ends: 94 [2025-01-10 01:26:24,784 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-01-10 01:26:24,784 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 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-01-10 01:26:24,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-10 01:26:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-10 01:26:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 71 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2025-01-10 01:26:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2025-01-10 01:26:24,792 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 35 [2025-01-10 01:26:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:24,792 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2025-01-10 01:26:24,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-01-10 01:26:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2025-01-10 01:26:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 01:26:24,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:24,792 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 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] [2025-01-10 01:26:24,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:26:24,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:24,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:24,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1376176296, now seen corresponding path program 1 times [2025-01-10 01:26:24,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:24,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334493629] [2025-01-10 01:26:24,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:24,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:24,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 01:26:24,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:26:24,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:24,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:26:24,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:24,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334493629] [2025-01-10 01:26:24,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334493629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:24,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:24,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:26:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127760334] [2025-01-10 01:26:24,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:24,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:26:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:24,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:26:24,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:26:24,863 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-01-10 01:26:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:24,900 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2025-01-10 01:26:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:26:24,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 44 [2025-01-10 01:26:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:24,901 INFO L225 Difference]: With dead ends: 104 [2025-01-10 01:26:24,901 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 01:26:24,901 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-01-10 01:26:24,902 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 173 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-01-10 01:26:24,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 173 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 01:26:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2025-01-10 01:26:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 70 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2025-01-10 01:26:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2025-01-10 01:26:24,908 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 44 [2025-01-10 01:26:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:24,909 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2025-01-10 01:26:24,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-01-10 01:26:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2025-01-10 01:26:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 01:26:24,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:24,910 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:24,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:26:24,910 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:24,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash 620191462, now seen corresponding path program 1 times [2025-01-10 01:26:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:24,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164119973] [2025-01-10 01:26:24,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:24,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 01:26:24,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:26:24,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:24,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:26:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164119973] [2025-01-10 01:26:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164119973] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682845697] [2025-01-10 01:26:25,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:25,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:25,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:25,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:25,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:26:25,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 01:26:25,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:26:25,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:25,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:25,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:26:25,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:26:25,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:26:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:26:25,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682845697] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:26:25,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:26:25,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 01:26:25,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988390791] [2025-01-10 01:26:25,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:26:25,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:26:25,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:25,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:26:25,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:26:25,248 INFO L87 Difference]: Start difference. First operand 93 states and 111 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-01-10 01:26:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:25,451 INFO L93 Difference]: Finished difference Result 195 states and 254 transitions. [2025-01-10 01:26:25,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:26:25,452 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 43 [2025-01-10 01:26:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:25,453 INFO L225 Difference]: With dead ends: 195 [2025-01-10 01:26:25,453 INFO L226 Difference]: Without dead ends: 193 [2025-01-10 01:26:25,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:26:25,454 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 102 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:25,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 391 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:26:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-10 01:26:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 118. [2025-01-10 01:26:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 88 states have internal predecessors, (96), 20 states have call successors, (20), 7 states have call predecessors, (20), 10 states have return successors, (34), 22 states have call predecessors, (34), 19 states have call successors, (34) [2025-01-10 01:26:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2025-01-10 01:26:25,467 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 43 [2025-01-10 01:26:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:25,467 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2025-01-10 01:26:25,467 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-01-10 01:26:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2025-01-10 01:26:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 01:26:25,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:25,470 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, 1] [2025-01-10 01:26:25,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:26:25,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:26:25,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash -997022116, now seen corresponding path program 1 times [2025-01-10 01:26:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:25,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788620080] [2025-01-10 01:26:25,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:25,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:26:25,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:26:25,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:25,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:26:25,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:25,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788620080] [2025-01-10 01:26:25,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788620080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:25,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:25,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:26:25,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804695413] [2025-01-10 01:26:25,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:25,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:26:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:25,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:26:25,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:26:25,718 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:26:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:25,732 INFO L93 Difference]: Finished difference Result 132 states and 172 transitions. [2025-01-10 01:26:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:26:25,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2025-01-10 01:26:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:25,733 INFO L225 Difference]: With dead ends: 132 [2025-01-10 01:26:25,733 INFO L226 Difference]: Without dead ends: 131 [2025-01-10 01:26:25,734 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-01-10 01:26:25,734 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-01-10 01:26:25,734 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-01-10 01:26:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-10 01:26:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2025-01-10 01:26:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 95 states have internal predecessors, (104), 20 states have call successors, (20), 7 states have call predecessors, (20), 12 states have return successors, (40), 25 states have call predecessors, (40), 19 states have call successors, (40) [2025-01-10 01:26:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2025-01-10 01:26:25,743 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 45 [2025-01-10 01:26:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:25,743 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2025-01-10 01:26:25,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:26:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2025-01-10 01:26:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 01:26:25,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:25,744 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:25,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:26:25,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:25,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 450169369, now seen corresponding path program 1 times [2025-01-10 01:26:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:25,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439781905] [2025-01-10 01:26:25,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:25,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 01:26:25,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:26:25,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:25,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:26:25,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:25,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439781905] [2025-01-10 01:26:25,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439781905] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:25,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271796284] [2025-01-10 01:26:25,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:25,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:25,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:25,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:25,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:26:25,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 01:26:25,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:26:25,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:25,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:25,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:26:25,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-10 01:26:25,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:26:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271796284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:26:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-01-10 01:26:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941404837] [2025-01-10 01:26:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:25,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:26:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:25,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:26:25,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:26:25,902 INFO L87 Difference]: Start difference. First operand 128 states and 164 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:26:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:26,009 INFO L93 Difference]: Finished difference Result 162 states and 207 transitions. [2025-01-10 01:26:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:26:26,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-01-10 01:26:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:26,016 INFO L225 Difference]: With dead ends: 162 [2025-01-10 01:26:26,016 INFO L226 Difference]: Without dead ends: 161 [2025-01-10 01:26:26,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:26:26,017 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:26,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 188 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:26:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-10 01:26:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2025-01-10 01:26:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.135135135135135) internal successors, (126), 115 states have internal predecessors, (126), 25 states have call successors, (25), 8 states have call predecessors, (25), 14 states have return successors, (47), 31 states have call predecessors, (47), 24 states have call successors, (47) [2025-01-10 01:26:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2025-01-10 01:26:26,027 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 50 [2025-01-10 01:26:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:26,027 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2025-01-10 01:26:26,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:26:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2025-01-10 01:26:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 01:26:26,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:26,028 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, 1, 1] [2025-01-10 01:26:26,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:26:26,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:26:26,228 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash -842914454, now seen corresponding path program 1 times [2025-01-10 01:26:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186105897] [2025-01-10 01:26:26,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:26,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 01:26:26,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:26:26,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:26,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:26:26,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:26,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186105897] [2025-01-10 01:26:26,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186105897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:26,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:26,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:26:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971341726] [2025-01-10 01:26:26,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:26,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:26:26,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:26,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:26:26,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:26,251 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-01-10 01:26:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:26,262 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2025-01-10 01:26:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:26:26,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 46 [2025-01-10 01:26:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:26,265 INFO L225 Difference]: With dead ends: 155 [2025-01-10 01:26:26,265 INFO L226 Difference]: Without dead ends: 151 [2025-01-10 01:26:26,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:26:26,266 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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-01-10 01:26:26,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-10 01:26:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-10 01:26:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.1111111111111112) internal successors, (120), 112 states have internal predecessors, (120), 25 states have call successors, (25), 8 states have call predecessors, (25), 14 states have return successors, (45), 30 states have call predecessors, (45), 24 states have call successors, (45) [2025-01-10 01:26:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2025-01-10 01:26:26,278 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 46 [2025-01-10 01:26:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:26,278 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2025-01-10 01:26:26,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-01-10 01:26:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2025-01-10 01:26:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 01:26:26,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:26,280 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:26,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:26:26,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:26,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1953786223, now seen corresponding path program 1 times [2025-01-10 01:26:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376077115] [2025-01-10 01:26:26,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:26,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 01:26:26,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 01:26:26,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:26,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-10 01:26:26,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:26,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376077115] [2025-01-10 01:26:26,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376077115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:26,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:26,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:26:26,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468187491] [2025-01-10 01:26:26,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:26,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:26:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:26,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:26:26,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:26:26,365 INFO L87 Difference]: Start difference. First operand 151 states and 190 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:26:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:26,419 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2025-01-10 01:26:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:26:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-01-10 01:26:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:26,421 INFO L225 Difference]: With dead ends: 151 [2025-01-10 01:26:26,421 INFO L226 Difference]: Without dead ends: 130 [2025-01-10 01:26:26,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:26:26,421 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:26,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 163 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-10 01:26:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2025-01-10 01:26:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 87 states have internal predecessors, (92), 19 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (31), 21 states have call predecessors, (31), 16 states have call successors, (31) [2025-01-10 01:26:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2025-01-10 01:26:26,433 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 85 [2025-01-10 01:26:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:26,434 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2025-01-10 01:26:26,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:26:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2025-01-10 01:26:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-10 01:26:26,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:26,435 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:26:26,435 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1333842528, now seen corresponding path program 2 times [2025-01-10 01:26:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:26,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521371225] [2025-01-10 01:26:26,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:26:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:26,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-01-10 01:26:26,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 01:26:26,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:26:26,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-10 01:26:26,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521371225] [2025-01-10 01:26:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521371225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:26:26,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:26:26,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:26:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780957627] [2025-01-10 01:26:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:26:26,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:26:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:26,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:26:26,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:26:26,565 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 5 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:26:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:26,622 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2025-01-10 01:26:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:26:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 80 [2025-01-10 01:26:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:26,625 INFO L225 Difference]: With dead ends: 117 [2025-01-10 01:26:26,625 INFO L226 Difference]: Without dead ends: 116 [2025-01-10 01:26:26,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:26:26,625 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:26:26,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 134 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-10 01:26:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-01-10 01:26:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 86 states have internal predecessors, (91), 19 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (31), 21 states have call predecessors, (31), 16 states have call successors, (31) [2025-01-10 01:26:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2025-01-10 01:26:26,636 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 80 [2025-01-10 01:26:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:26,637 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2025-01-10 01:26:26,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:26:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2025-01-10 01:26:26,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-10 01:26:26,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:26:26,641 INFO L218 NwaCegarLoop]: trace histogram [59, 53, 38, 21, 21, 21, 21, 19, 19, 19, 19, 19, 18, 18, 18, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:26:26,641 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:26:26,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:26:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2079133122, now seen corresponding path program 1 times [2025-01-10 01:26:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:26:26,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153335464] [2025-01-10 01:26:26,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:26:26,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-10 01:26:26,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-10 01:26:26,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:26,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8158 backedges. 354 proven. 931 refuted. 0 times theorem prover too weak. 6873 trivial. 0 not checked. [2025-01-10 01:26:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:26:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153335464] [2025-01-10 01:26:26,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153335464] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:26:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325288467] [2025-01-10 01:26:26,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:26:26,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:26,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:26:26,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:26:26,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:26:27,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-10 01:26:27,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-10 01:26:27,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:26:27,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:26:27,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:26:27,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:26:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8158 backedges. 1521 proven. 2 refuted. 0 times theorem prover too weak. 6635 trivial. 0 not checked. [2025-01-10 01:26:27,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:26:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8158 backedges. 354 proven. 931 refuted. 0 times theorem prover too weak. 6873 trivial. 0 not checked. [2025-01-10 01:26:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325288467] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:26:27,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:26:27,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-01-10 01:26:27,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755440908] [2025-01-10 01:26:27,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:26:27,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:26:27,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:26:27,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:26:27,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:26:27,513 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-10 01:26:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:26:27,581 INFO L93 Difference]: Finished difference Result 156 states and 190 transitions. [2025-01-10 01:26:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:26:27,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 456 [2025-01-10 01:26:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:26:27,582 INFO L225 Difference]: With dead ends: 156 [2025-01-10 01:26:27,582 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:26:27,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 907 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:26:27,583 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 133 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-01-10 01:26:27,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 133 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:26:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:26:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:26:27,584 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-01-10 01:26:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:26:27,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 456 [2025-01-10 01:26:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:26:27,584 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:26:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-10 01:26:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:26:27,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:26:27,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-01-10 01:26:27,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 01:26:27,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 01:26:27,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 01:26:27,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 01:26:27,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 01:26:27,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 01:26:27,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 01:26:27,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 01:26:27,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-01-10 01:26:27,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:26:27,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:26:27,790 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:26:27,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:26:28,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:26:28,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:26:28 BoogieIcfgContainer [2025-01-10 01:26:28,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:26:28,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:26:28,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:26:28,116 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:26:28,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:26:23" (3/4) ... [2025-01-10 01:26:28,118 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:26:28,122 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2025-01-10 01:26:28,123 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2025-01-10 01:26:28,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 01:26:28,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:26:28,125 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 01:26:28,181 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:26:28,181 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:26:28,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:26:28,182 INFO L158 Benchmark]: Toolchain (without parser) took 5193.93ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 85.7MB in the end (delta: 36.5MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2025-01-10 01:26:28,182 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:26:28,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.18ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 111.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:26:28,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.86ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 111.0MB in the end (delta: 823.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:26:28,183 INFO L158 Benchmark]: Boogie Preprocessor took 20.23ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.1MB in the end (delta: 830.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:26:28,183 INFO L158 Benchmark]: RCFGBuilder took 204.31ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 98.8MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:26:28,183 INFO L158 Benchmark]: TraceAbstraction took 4739.55ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 92.5MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:26:28,184 INFO L158 Benchmark]: Witness Printer took 67.00ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 85.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:26:28,188 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.22ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.18ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 111.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.86ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 111.0MB in the end (delta: 823.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.23ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.1MB in the end (delta: 830.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 204.31ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 98.8MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4739.55ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 92.5MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.00ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 85.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 46 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 19, TraceHistogramMax: 59, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 2767 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1990 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 715 IncrementalHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 777 mSDtfsCounter, 715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1157 GetRequests, 1055 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=15, InterpolantAutomatonStates: 117, 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, 19 MinimizatonAttempts, 167 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1630 NumberOfCodeBlocks, 1630 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2105 ConstructedInterpolants, 0 QuantifiedInterpolants, 2491 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1094 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 24 InterpolantComputations, 17 PerfectInterpolantSequences, 23283/25155 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-01-10 01:26:28,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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