./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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_1b.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 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:55:04,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:55:04,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 08:55:04,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:55:04,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:55:04,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:55:04,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:55:04,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:55:04,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:55:04,238 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:55:04,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:55:04,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:55:04,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:55:04,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:55:04,239 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:55:04,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:55:04,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:55:04,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:55:04,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:55:04,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:55:04,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:55:04,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:55:04,243 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 -> 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c [2025-02-08 08:55:04,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:55:04,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:55:04,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:55:04,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:55:04,491 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:55:04,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2025-02-08 08:55:05,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e8aba761/cff7a90ac4234eea9bf67a27052c70ab/FLAG3ff781b31 [2025-02-08 08:55:05,875 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:55:05,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2025-02-08 08:55:05,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e8aba761/cff7a90ac4234eea9bf67a27052c70ab/FLAG3ff781b31 [2025-02-08 08:55:06,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e8aba761/cff7a90ac4234eea9bf67a27052c70ab [2025-02-08 08:55:06,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:55:06,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:55:06,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:55:06,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:55:06,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:55:06,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e280acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06, skipping insertion in model container [2025-02-08 08:55:06,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:55:06,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:55:06,366 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:55:06,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:55:06,384 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:55:06,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06 WrapperNode [2025-02-08 08:55:06,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:55:06,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:55:06,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:55:06,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:55:06,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,401 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2025-02-08 08:55:06,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:55:06,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:55:06,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:55:06,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:55:06,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,410 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 08:55:06,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:55:06,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:55:06,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:55:06,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:55:06,419 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (1/1) ... [2025-02-08 08:55:06,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:55:06,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:06,454 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-02-08 08:55:06,456 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-02-08 08:55:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2025-02-08 08:55:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2025-02-08 08:55:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2025-02-08 08:55:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2025-02-08 08:55:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:55:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:55:06,524 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:55:06,526 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:55:06,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L14: havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; [2025-02-08 08:55:06,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret3;havoc #t~ret4; [2025-02-08 08:55:06,646 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-08 08:55:06,646 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:55:06,659 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:55:06,661 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:55:06,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:55:06 BoogieIcfgContainer [2025-02-08 08:55:06,661 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:55:06,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:55:06,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:55:06,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:55:06,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:55:06" (1/3) ... [2025-02-08 08:55:06,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1405f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:55:06, skipping insertion in model container [2025-02-08 08:55:06,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:06" (2/3) ... [2025-02-08 08:55:06,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1405f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:55:06, skipping insertion in model container [2025-02-08 08:55:06,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:55:06" (3/3) ... [2025-02-08 08:55:06,670 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2025-02-08 08:55:06,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:55:06,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_1b.c that has 3 procedures, 43 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-02-08 08:55:06,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:55:06,734 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;@3e07a2da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:55:06,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 08:55:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.5) internal successors, (36), 34 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 08:55:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 08:55:06,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:06,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 08:55:06,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:06,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash 69063447, now seen corresponding path program 1 times [2025-02-08 08:55:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952692721] [2025-02-08 08:55:06,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:06,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:55:06,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:55:06,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:06,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:06,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:06,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952692721] [2025-02-08 08:55:06,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952692721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:06,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:06,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:06,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17880795] [2025-02-08 08:55:06,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:06,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:06,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:06,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:06,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:06,892 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.5) internal successors, (36), 34 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 08:55:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:06,915 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-02-08 08:55:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-02-08 08:55:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:06,921 INFO L225 Difference]: With dead ends: 45 [2025-02-08 08:55:06,922 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 08:55:06,924 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-02-08 08:55:06,927 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 81 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-02-08 08:55:06,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 08:55:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-02-08 08:55:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 08:55:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-08 08:55:06,963 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 5 [2025-02-08 08:55:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-08 08:55:06,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 08:55:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-08 08:55:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 08:55:06,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:06,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:55:06,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:55:06,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:06,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:06,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2140966859, now seen corresponding path program 1 times [2025-02-08 08:55:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984129012] [2025-02-08 08:55:06,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:06,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:55:06,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:55:06,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:06,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:07,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984129012] [2025-02-08 08:55:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984129012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:07,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206397932] [2025-02-08 08:55:07,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:55:07,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:55:07,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:55:07,021 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-02-08 08:55:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,088 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2025-02-08 08:55:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:55:07,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2025-02-08 08:55:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,090 INFO L225 Difference]: With dead ends: 56 [2025-02-08 08:55:07,090 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 08:55:07,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-02-08 08:55:07,090 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:07,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 156 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 08:55:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-02-08 08:55:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.4) internal successors, (42), 38 states have internal predecessors, (42), 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-02-08 08:55:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-02-08 08:55:07,099 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2025-02-08 08:55:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,099 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-02-08 08:55:07,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-02-08 08:55:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-02-08 08:55:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 08:55:07,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:55:07,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1005817705, now seen corresponding path program 1 times [2025-02-08 08:55:07,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808882797] [2025-02-08 08:55:07,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:55:07,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:55:07,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:07,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808882797] [2025-02-08 08:55:07,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808882797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:07,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037484836] [2025-02-08 08:55:07,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:07,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:07,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:07,133 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-08 08:55:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,147 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-02-08 08:55:07,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:07,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2025-02-08 08:55:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,150 INFO L225 Difference]: With dead ends: 51 [2025-02-08 08:55:07,150 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 08:55:07,150 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-02-08 08:55:07,151 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 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-02-08 08:55:07,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 08:55:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-02-08 08:55:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 37 states have internal predecessors, (41), 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-02-08 08:55:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-02-08 08:55:07,166 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 10 [2025-02-08 08:55:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,166 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-02-08 08:55:07,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-02-08 08:55:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-02-08 08:55:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:55:07,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:55:07,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1115577768, now seen corresponding path program 1 times [2025-02-08 08:55:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853847245] [2025-02-08 08:55:07,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:55:07,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:55:07,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:07,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853847245] [2025-02-08 08:55:07,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853847245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:07,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126372417] [2025-02-08 08:55:07,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:55:07,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:55:07,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:55:07,269 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-02-08 08:55:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,364 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-02-08 08:55:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:07,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-02-08 08:55:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,366 INFO L225 Difference]: With dead ends: 73 [2025-02-08 08:55:07,369 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 08:55:07,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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-02-08 08:55:07,370 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:07,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 181 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 08:55:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2025-02-08 08:55:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.380952380952381) internal successors, (58), 49 states have internal predecessors, (58), 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-02-08 08:55:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-02-08 08:55:07,380 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2025-02-08 08:55:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,380 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-02-08 08:55:07,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-02-08 08:55:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-02-08 08:55:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 08:55:07,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:55:07,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1794682759, now seen corresponding path program 1 times [2025-02-08 08:55:07,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324351567] [2025-02-08 08:55:07,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:55:07,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:55:07,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:07,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324351567] [2025-02-08 08:55:07,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324351567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631872169] [2025-02-08 08:55:07,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:07,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:07,478 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 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-02-08 08:55:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,536 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2025-02-08 08:55:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:55:07,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 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 17 [2025-02-08 08:55:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,537 INFO L225 Difference]: With dead ends: 123 [2025-02-08 08:55:07,538 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 08:55:07,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:55:07,539 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:07,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 191 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 08:55:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2025-02-08 08:55:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 58 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2025-02-08 08:55:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2025-02-08 08:55:07,571 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 17 [2025-02-08 08:55:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,571 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2025-02-08 08:55:07,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 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-02-08 08:55:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2025-02-08 08:55:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 08:55:07,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,572 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:55:07,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash 889889281, now seen corresponding path program 1 times [2025-02-08 08:55:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122440591] [2025-02-08 08:55:07,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:55:07,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:55:07,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:07,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122440591] [2025-02-08 08:55:07,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122440591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048468196] [2025-02-08 08:55:07,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:55:07,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:55:07,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:55:07,643 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,684 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2025-02-08 08:55:07,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:55:07,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-02-08 08:55:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,687 INFO L225 Difference]: With dead ends: 97 [2025-02-08 08:55:07,687 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 08:55:07,688 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-02-08 08:55:07,688 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:07,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 08:55:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2025-02-08 08:55:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 60 states have internal predecessors, (69), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (20), 14 states have call predecessors, (20), 12 states have call successors, (20) [2025-02-08 08:55:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2025-02-08 08:55:07,707 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 18 [2025-02-08 08:55:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,708 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2025-02-08 08:55:07,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2025-02-08 08:55:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:55:07,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,709 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:55:07,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1885965220, now seen corresponding path program 1 times [2025-02-08 08:55:07,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017626219] [2025-02-08 08:55:07,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:55:07,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:55:07,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:07,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017626219] [2025-02-08 08:55:07,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017626219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:07,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752095389] [2025-02-08 08:55:07,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:55:07,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:55:07,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:55:07,781 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,801 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2025-02-08 08:55:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:55:07,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-08 08:55:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,803 INFO L225 Difference]: With dead ends: 89 [2025-02-08 08:55:07,803 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 08:55:07,803 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-02-08 08:55:07,803 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 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-02-08 08:55:07,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 08:55:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-02-08 08:55:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 64 states have internal predecessors, (74), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2025-02-08 08:55:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2025-02-08 08:55:07,811 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 19 [2025-02-08 08:55:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,811 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2025-02-08 08:55:07,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2025-02-08 08:55:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:55:07,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,812 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:55:07,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1816763914, now seen corresponding path program 1 times [2025-02-08 08:55:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58983965] [2025-02-08 08:55:07,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:55:07,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:55:07,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:07,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58983965] [2025-02-08 08:55:07,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58983965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:07,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609731063] [2025-02-08 08:55:07,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:07,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:07,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:07,833 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 08:55:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,841 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2025-02-08 08:55:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:07,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 19 [2025-02-08 08:55:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,842 INFO L225 Difference]: With dead ends: 86 [2025-02-08 08:55:07,843 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 08:55:07,843 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-02-08 08:55:07,843 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:07,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 08:55:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-08 08:55:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 63 states have internal predecessors, (72), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2025-02-08 08:55:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2025-02-08 08:55:07,851 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 19 [2025-02-08 08:55:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,851 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2025-02-08 08:55:07,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 08:55:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2025-02-08 08:55:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:55:07,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,852 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-02-08 08:55:07,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:55:07,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1664620330, now seen corresponding path program 1 times [2025-02-08 08:55:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143490254] [2025-02-08 08:55:07,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:55:07,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:55:07,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:07,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143490254] [2025-02-08 08:55:07,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143490254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:07,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668710456] [2025-02-08 08:55:07,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:07,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:07,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:07,870 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,878 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2025-02-08 08:55:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-02-08 08:55:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,879 INFO L225 Difference]: With dead ends: 85 [2025-02-08 08:55:07,879 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 08:55:07,879 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-02-08 08:55:07,880 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-02-08 08:55:07,880 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-02-08 08:55:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 08:55:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-08 08:55:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 59 states have internal predecessors, (66), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (19), 14 states have call predecessors, (19), 11 states have call successors, (19) [2025-02-08 08:55:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2025-02-08 08:55:07,886 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 20 [2025-02-08 08:55:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,886 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2025-02-08 08:55:07,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2025-02-08 08:55:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 08:55:07,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,887 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] [2025-02-08 08:55:07,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:55:07,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1997090365, now seen corresponding path program 1 times [2025-02-08 08:55:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78095949] [2025-02-08 08:55:07,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:07,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:55:07,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:55:07,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:07,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:07,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:07,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78095949] [2025-02-08 08:55:07,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78095949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:07,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:07,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:07,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454501484] [2025-02-08 08:55:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:07,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:07,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:07,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:07,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:07,928 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-02-08 08:55:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:07,973 INFO L93 Difference]: Finished difference Result 162 states and 217 transitions. [2025-02-08 08:55:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:07,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2025-02-08 08:55:07,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:07,975 INFO L225 Difference]: With dead ends: 162 [2025-02-08 08:55:07,975 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 08:55:07,975 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-02-08 08:55:07,976 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:07,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 08:55:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2025-02-08 08:55:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 66 states have internal predecessors, (71), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (21), 14 states have call predecessors, (21), 13 states have call successors, (21) [2025-02-08 08:55:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-02-08 08:55:07,991 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 24 [2025-02-08 08:55:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:07,992 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-02-08 08:55:07,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-02-08 08:55:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-02-08 08:55:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 08:55:07,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:07,992 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:07,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:55:07,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:07,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:07,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1549819585, now seen corresponding path program 1 times [2025-02-08 08:55:07,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:07,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453718627] [2025-02-08 08:55:07,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:07,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:08,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:55:08,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:55:08,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:55:08,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:08,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453718627] [2025-02-08 08:55:08,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453718627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:08,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:08,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:08,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842674278] [2025-02-08 08:55:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:08,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:08,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:08,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:08,069 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 08:55:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:08,127 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2025-02-08 08:55:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:08,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 30 [2025-02-08 08:55:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:08,132 INFO L225 Difference]: With dead ends: 172 [2025-02-08 08:55:08,132 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 08:55:08,133 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-02-08 08:55:08,133 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:08,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 190 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 08:55:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2025-02-08 08:55:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.1875) internal successors, (76), 71 states have internal predecessors, (76), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2025-02-08 08:55:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2025-02-08 08:55:08,148 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 30 [2025-02-08 08:55:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:08,148 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2025-02-08 08:55:08,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-02-08 08:55:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2025-02-08 08:55:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 08:55:08,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:08,153 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-02-08 08:55:08,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:55:08,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:08,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1814912906, now seen corresponding path program 1 times [2025-02-08 08:55:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675564879] [2025-02-08 08:55:08,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:08,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:55:08,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:55:08,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-08 08:55:08,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:08,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675564879] [2025-02-08 08:55:08,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675564879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:08,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439506502] [2025-02-08 08:55:08,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:08,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:08,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:08,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:08,202 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-02-08 08:55:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:08,214 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2025-02-08 08:55:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:08,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 37 [2025-02-08 08:55:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:08,215 INFO L225 Difference]: With dead ends: 95 [2025-02-08 08:55:08,215 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 08:55:08,215 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-02-08 08:55:08,216 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 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-02-08 08:55:08,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 08:55:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-08 08:55:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.15625) internal successors, (74), 70 states have internal predecessors, (74), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2025-02-08 08:55:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2025-02-08 08:55:08,222 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 37 [2025-02-08 08:55:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:08,222 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2025-02-08 08:55:08,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-02-08 08:55:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2025-02-08 08:55:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 08:55:08,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:08,223 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, 1] [2025-02-08 08:55:08,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:55:08,223 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:08,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash -427725267, now seen corresponding path program 1 times [2025-02-08 08:55:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200438009] [2025-02-08 08:55:08,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:08,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 08:55:08,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 08:55:08,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:55:08,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:08,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200438009] [2025-02-08 08:55:08,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200438009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:08,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:08,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568411895] [2025-02-08 08:55:08,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:08,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:55:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:08,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:55:08,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:55:08,277 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-02-08 08:55:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:08,293 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2025-02-08 08:55:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:55:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 38 [2025-02-08 08:55:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:08,294 INFO L225 Difference]: With dead ends: 101 [2025-02-08 08:55:08,294 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:55:08,295 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-02-08 08:55:08,295 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:08,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:55:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-08 08:55:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 74 states have internal predecessors, (80), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2025-02-08 08:55:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2025-02-08 08:55:08,301 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 38 [2025-02-08 08:55:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:08,302 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2025-02-08 08:55:08,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-02-08 08:55:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2025-02-08 08:55:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 08:55:08,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:08,303 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] [2025-02-08 08:55:08,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:55:08,303 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:08,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -829345306, now seen corresponding path program 1 times [2025-02-08 08:55:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:08,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612399752] [2025-02-08 08:55:08,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:08,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 08:55:08,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 08:55:08,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:55:08,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:08,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612399752] [2025-02-08 08:55:08,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612399752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:08,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:08,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:08,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532923314] [2025-02-08 08:55:08,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:08,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:08,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:08,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:08,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:08,348 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-02-08 08:55:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:08,378 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2025-02-08 08:55:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:08,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 42 [2025-02-08 08:55:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:08,379 INFO L225 Difference]: With dead ends: 110 [2025-02-08 08:55:08,379 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 08:55:08,379 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-02-08 08:55:08,380 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 161 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-02-08 08:55:08,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 161 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 08:55:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2025-02-08 08:55:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 73 states have internal predecessors, (78), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2025-02-08 08:55:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2025-02-08 08:55:08,386 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 42 [2025-02-08 08:55:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:08,386 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2025-02-08 08:55:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-02-08 08:55:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2025-02-08 08:55:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 08:55:08,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:08,387 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] [2025-02-08 08:55:08,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:55:08,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:08,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash -416632098, now seen corresponding path program 1 times [2025-02-08 08:55:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:08,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281139472] [2025-02-08 08:55:08,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:08,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 08:55:08,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 08:55:08,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:55:08,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:08,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281139472] [2025-02-08 08:55:08,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281139472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:08,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78893929] [2025-02-08 08:55:08,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:08,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:08,489 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-02-08 08:55:08,491 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-02-08 08:55:08,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 08:55:08,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 08:55:08,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:55:08,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 08:55:08,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:55:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78893929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:08,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:55:08,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-02-08 08:55:08,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876262000] [2025-02-08 08:55:08,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:08,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:08,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:08,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:55:08,610 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-02-08 08:55:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:08,665 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2025-02-08 08:55:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:08,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 41 [2025-02-08 08:55:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:08,666 INFO L225 Difference]: With dead ends: 100 [2025-02-08 08:55:08,668 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 08:55:08,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:55:08,668 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:08,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 168 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 08:55:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-02-08 08:55:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.1) internal successors, (77), 72 states have internal predecessors, (77), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2025-02-08 08:55:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2025-02-08 08:55:08,678 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 41 [2025-02-08 08:55:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:08,679 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2025-02-08 08:55:08,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-02-08 08:55:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2025-02-08 08:55:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 08:55:08,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:08,681 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:08,689 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-02-08 08:55:08,885 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,SelfDestructingSolverStorable14 [2025-02-08 08:55:08,886 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:08,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash 507672329, now seen corresponding path program 1 times [2025-02-08 08:55:08,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:08,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66836778] [2025-02-08 08:55:08,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:08,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 08:55:08,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 08:55:08,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:08,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 08:55:08,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:08,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66836778] [2025-02-08 08:55:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66836778] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:08,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77452481] [2025-02-08 08:55:08,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:08,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:08,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:09,000 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-02-08 08:55:09,002 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-02-08 08:55:09,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 08:55:09,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 08:55:09,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:09,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:09,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:55:09,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-08 08:55:09,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:55:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77452481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:55:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-02-08 08:55:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128724156] [2025-02-08 08:55:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:09,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:09,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:55:09,094 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-02-08 08:55:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:09,184 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2025-02-08 08:55:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:55:09,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 53 [2025-02-08 08:55:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:09,186 INFO L225 Difference]: With dead ends: 127 [2025-02-08 08:55:09,186 INFO L226 Difference]: Without dead ends: 126 [2025-02-08 08:55:09,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 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-02-08 08:55:09,187 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 168 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-02-08 08:55:09,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 168 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-08 08:55:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-02-08 08:55:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.1) internal successors, (99), 92 states have internal predecessors, (99), 21 states have call successors, (21), 8 states have call predecessors, (21), 11 states have return successors, (31), 24 states have call predecessors, (31), 20 states have call successors, (31) [2025-02-08 08:55:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2025-02-08 08:55:09,196 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 53 [2025-02-08 08:55:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:09,197 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2025-02-08 08:55:09,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-02-08 08:55:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2025-02-08 08:55:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 08:55:09,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:09,198 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1] [2025-02-08 08:55:09,204 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-02-08 08:55:09,398 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,SelfDestructingSolverStorable15 [2025-02-08 08:55:09,399 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:09,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:09,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1035611765, now seen corresponding path program 1 times [2025-02-08 08:55:09,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:09,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123683278] [2025-02-08 08:55:09,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:09,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:09,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 08:55:09,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:55:09,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:09,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:55:09,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:09,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123683278] [2025-02-08 08:55:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123683278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:09,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271507731] [2025-02-08 08:55:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:09,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:09,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:09,556 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-02-08 08:55:09,559 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-02-08 08:55:09,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 08:55:09,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:55:09,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:09,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:09,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:55:09,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 08:55:09,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:55:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271507731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:09,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:55:09,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-02-08 08:55:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340932280] [2025-02-08 08:55:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:09,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:55:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:09,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:55:09,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:55:09,647 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 5 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 08:55:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:09,711 INFO L93 Difference]: Finished difference Result 154 states and 187 transitions. [2025-02-08 08:55:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:55:09,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2025-02-08 08:55:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:09,712 INFO L225 Difference]: With dead ends: 154 [2025-02-08 08:55:09,712 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 08:55:09,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:55:09,713 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:09,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 116 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:09,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 08:55:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-02-08 08:55:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.1) internal successors, (121), 112 states have internal predecessors, (121), 26 states have call successors, (26), 9 states have call predecessors, (26), 13 states have return successors, (39), 30 states have call predecessors, (39), 25 states have call successors, (39) [2025-02-08 08:55:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2025-02-08 08:55:09,721 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 46 [2025-02-08 08:55:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:09,722 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2025-02-08 08:55:09,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 08:55:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2025-02-08 08:55:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 08:55:09,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:09,722 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 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, 1, 1] [2025-02-08 08:55:09,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:55:09,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:09,927 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:09,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash 561027091, now seen corresponding path program 1 times [2025-02-08 08:55:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:09,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726805551] [2025-02-08 08:55:09,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:09,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:09,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 08:55:09,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 08:55:09,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:09,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 08:55:09,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:09,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726805551] [2025-02-08 08:55:09,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726805551] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:09,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643847957] [2025-02-08 08:55:09,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:09,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:09,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:09,979 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:09,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:55:10,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 08:55:10,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 08:55:10,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:10,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:10,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:55:10,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 08:55:10,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 08:55:10,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643847957] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:10,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:10,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 08:55:10,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688930633] [2025-02-08 08:55:10,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:10,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:55:10,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:10,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:55:10,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:55:10,179 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 08:55:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:10,207 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2025-02-08 08:55:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:55:10,208 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2025-02-08 08:55:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:10,209 INFO L225 Difference]: With dead ends: 174 [2025-02-08 08:55:10,209 INFO L226 Difference]: Without dead ends: 167 [2025-02-08 08:55:10,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:55:10,210 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:10,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 172 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-08 08:55:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-02-08 08:55:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 122 states have (on average 1.0901639344262295) internal successors, (133), 124 states have internal predecessors, (133), 26 states have call successors, (26), 9 states have call predecessors, (26), 16 states have return successors, (42), 33 states have call predecessors, (42), 25 states have call successors, (42) [2025-02-08 08:55:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 201 transitions. [2025-02-08 08:55:10,219 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 201 transitions. Word has length 59 [2025-02-08 08:55:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:10,219 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 201 transitions. [2025-02-08 08:55:10,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 08:55:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 201 transitions. [2025-02-08 08:55:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 08:55:10,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:10,220 INFO L218 NwaCegarLoop]: trace histogram [11, 8, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:10,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:55:10,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 08:55:10,421 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:10,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash 380602730, now seen corresponding path program 2 times [2025-02-08 08:55:10,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:10,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110716465] [2025-02-08 08:55:10,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:55:10,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:10,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-08 08:55:10,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 08:55:10,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:55:10,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-02-08 08:55:10,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:10,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110716465] [2025-02-08 08:55:10,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110716465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:10,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:10,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:55:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917778901] [2025-02-08 08:55:10,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:10,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:55:10,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:10,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:55:10,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:55:10,466 INFO L87 Difference]: Start difference. First operand 167 states and 201 transitions. Second operand has 5 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-02-08 08:55:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:10,522 INFO L93 Difference]: Finished difference Result 168 states and 201 transitions. [2025-02-08 08:55:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:55:10,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 83 [2025-02-08 08:55:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:10,523 INFO L225 Difference]: With dead ends: 168 [2025-02-08 08:55:10,523 INFO L226 Difference]: Without dead ends: 167 [2025-02-08 08:55:10,524 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-02-08 08:55:10,524 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 27 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 150 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-02-08 08:55:10,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-08 08:55:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2025-02-08 08:55:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 123 states have internal predecessors, (132), 26 states have call successors, (26), 9 states have call predecessors, (26), 16 states have return successors, (42), 33 states have call predecessors, (42), 25 states have call successors, (42) [2025-02-08 08:55:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2025-02-08 08:55:10,535 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 83 [2025-02-08 08:55:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:10,536 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2025-02-08 08:55:10,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-02-08 08:55:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2025-02-08 08:55:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 08:55:10,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:10,540 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:55:10,540 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:10,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -765967137, now seen corresponding path program 1 times [2025-02-08 08:55:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756178988] [2025-02-08 08:55:10,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:10,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 08:55:10,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 08:55:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 52 proven. 77 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-08 08:55:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756178988] [2025-02-08 08:55:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756178988] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155772972] [2025-02-08 08:55:10,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:10,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:10,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:10,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:10,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:55:10,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 08:55:10,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 08:55:10,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:10,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:10,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:55:10,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 216 proven. 28 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-08 08:55:10,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 52 proven. 77 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-08 08:55:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155772972] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:10,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:10,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2025-02-08 08:55:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911982528] [2025-02-08 08:55:10,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:10,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:55:10,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:10,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:55:10,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:55:10,881 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-08 08:55:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:10,947 INFO L93 Difference]: Finished difference Result 271 states and 332 transitions. [2025-02-08 08:55:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:55:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 105 [2025-02-08 08:55:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:10,948 INFO L225 Difference]: With dead ends: 271 [2025-02-08 08:55:10,948 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 08:55:10,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:55:10,949 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:10,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 110 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 08:55:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2025-02-08 08:55:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 70 states have internal predecessors, (72), 12 states have call successors, (12), 7 states have call predecessors, (12), 12 states have return successors, (18), 15 states have call predecessors, (18), 11 states have call successors, (18) [2025-02-08 08:55:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2025-02-08 08:55:10,955 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 105 [2025-02-08 08:55:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:10,955 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2025-02-08 08:55:10,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-08 08:55:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2025-02-08 08:55:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-08 08:55:10,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:10,957 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 19, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2025-02-08 08:55:10,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:55:11,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:11,161 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 08:55:11,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash -429206204, now seen corresponding path program 2 times [2025-02-08 08:55:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645645688] [2025-02-08 08:55:11,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:55:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:11,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 249 statements into 2 equivalence classes. [2025-02-08 08:55:11,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-02-08 08:55:11,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:55:11,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 58 proven. 271 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2025-02-08 08:55:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645645688] [2025-02-08 08:55:11,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645645688] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649800702] [2025-02-08 08:55:11,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:55:11,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:11,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:11,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:11,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:55:11,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 249 statements into 2 equivalence classes. [2025-02-08 08:55:11,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 249 of 249 statements. [2025-02-08 08:55:11,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:55:11,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:11,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 08:55:11,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 742 proven. 24 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2025-02-08 08:55:11,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 58 proven. 271 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2025-02-08 08:55:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649800702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:11,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 11 [2025-02-08 08:55:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52862057] [2025-02-08 08:55:11,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:11,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:55:11,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:11,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:55:11,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:55:11,814 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-08 08:55:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:11,910 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2025-02-08 08:55:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:55:11,911 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) Word has length 249 [2025-02-08 08:55:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:11,911 INFO L225 Difference]: With dead ends: 137 [2025-02-08 08:55:11,911 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:55:11,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 490 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:55:11,912 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:11,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 144 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:55:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:55:11,912 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-02-08 08:55:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:55:11,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2025-02-08 08:55:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:11,913 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:55:11,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-08 08:55:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:55:11,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:55:11,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-02-08 08:55:11,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-02-08 08:55:11,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-02-08 08:55:11,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-02-08 08:55:11,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-02-08 08:55:11,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-02-08 08:55:11,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-02-08 08:55:11,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-02-08 08:55:11,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-02-08 08:55:11,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-02-08 08:55:11,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:55:12,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 08:55:12,119 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:12,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:55:12,627 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:55:12,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:55:12 BoogieIcfgContainer [2025-02-08 08:55:12,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:55:12,633 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:55:12,633 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:55:12,633 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:55:12,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:55:06" (3/4) ... [2025-02-08 08:55:12,635 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:55:12,639 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec1 [2025-02-08 08:55:12,639 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rec2 [2025-02-08 08:55:12,643 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 08:55:12,643 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:55:12,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:55:12,710 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:55:12,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:55:12,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:55:12,711 INFO L158 Benchmark]: Toolchain (without parser) took 6467.95ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.9MB in the beginning and 60.4MB in the end (delta: 52.5MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2025-02-08 08:55:12,711 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:55:12,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.72ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 103.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:55:12,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.74ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.9MB in the end (delta: 906.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:55:12,712 INFO L158 Benchmark]: Boogie Preprocessor took 16.84ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 919.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:55:12,712 INFO L158 Benchmark]: IcfgBuilder took 242.58ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 89.7MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:55:12,712 INFO L158 Benchmark]: TraceAbstraction took 5969.82ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 88.8MB in the beginning and 65.0MB in the end (delta: 23.7MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2025-02-08 08:55:12,712 INFO L158 Benchmark]: Witness Printer took 77.43ms. Allocated memory is still 176.2MB. Free memory was 65.0MB in the beginning and 60.4MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:55:12,717 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.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.72ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 103.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.74ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 101.9MB in the end (delta: 906.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.84ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 919.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 242.58ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 89.7MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5969.82ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 88.8MB in the beginning and 65.0MB in the end (delta: 23.7MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * Witness Printer took 77.43ms. Allocated memory is still 176.2MB. Free memory was 65.0MB in the beginning and 60.4MB in the end (delta: 4.6MB). 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, 43 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 21, TraceHistogramMax: 25, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 2793 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1974 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 692 IncrementalHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 819 mSDtfsCounter, 692 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 954 SyntacticMatches, 12 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=18, InterpolantAutomatonStates: 122, 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, 21 MinimizatonAttempts, 86 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1485 NumberOfCodeBlocks, 1485 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1868 ConstructedInterpolants, 0 QuantifiedInterpolants, 2592 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1119 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 5864/6630 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-02-08 08:55:12,732 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