./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:22:47,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:22:47,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:22:47,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:22:47,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:22:47,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:22:47,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:22:47,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:22:47,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:22:47,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:22:47,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:22:47,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:22:47,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:22:47,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:22:47,411 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:22:47,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:22:47,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:22:47,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:47,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:22:47,413 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2025-02-06 13:22:47,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:22:47,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:22:47,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:22:47,653 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:22:47,653 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:22:47,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-02-06 13:22:48,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56731a1ed/14b83a9432b74d528e4d14e0919a8666/FLAGfd8cbe5cd [2025-02-06 13:22:49,057 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:22:49,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-02-06 13:22:49,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56731a1ed/14b83a9432b74d528e4d14e0919a8666/FLAGfd8cbe5cd [2025-02-06 13:22:49,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56731a1ed/14b83a9432b74d528e4d14e0919a8666 [2025-02-06 13:22:49,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:22:49,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:22:49,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:49,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:22:49,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:22:49,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14cafd14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49, skipping insertion in model container [2025-02-06 13:22:49,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:22:49,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:49,513 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:22:49,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:49,560 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:22:49,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49 WrapperNode [2025-02-06 13:22:49,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:49,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:49,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:22:49,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:22:49,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,586 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-02-06 13:22:49,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:49,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:22:49,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:22:49,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:22:49,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,602 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 13:22:49,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:22:49,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:22:49,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:22:49,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:22:49,613 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (1/1) ... [2025-02-06 13:22:49,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:49,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:49,641 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-06 13:22:49,643 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-06 13:22:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:22:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:22:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-06 13:22:49,659 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-06 13:22:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:22:49,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:22:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-02-06 13:22:49,659 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-02-06 13:22:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 13:22:49,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 13:22:49,713 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:22:49,715 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:22:50,076 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-02-06 13:22:50,077 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:22:50,098 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:22:50,099 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 13:22:50,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:50 BoogieIcfgContainer [2025-02-06 13:22:50,099 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:22:50,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:22:50,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:22:50,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:22:50,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:22:49" (1/3) ... [2025-02-06 13:22:50,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206d83f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:50, skipping insertion in model container [2025-02-06 13:22:50,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:49" (2/3) ... [2025-02-06 13:22:50,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206d83f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:50, skipping insertion in model container [2025-02-06 13:22:50,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:50" (3/3) ... [2025-02-06 13:22:50,107 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-02-06 13:22:50,117 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:22:50,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 110 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-02-06 13:22:50,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:22:50,167 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;@109ac26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:22:50,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 13:22:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 80 states have (on average 1.5625) internal successors, (125), 97 states have internal predecessors, (125), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 13:22:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:22:50,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:50,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:50,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:50,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1228815374, now seen corresponding path program 1 times [2025-02-06 13:22:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:50,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93827765] [2025-02-06 13:22:50,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:50,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:50,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:22:50,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:22:50,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:50,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:50,357 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-06 13:22:50,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:50,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93827765] [2025-02-06 13:22:50,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93827765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:50,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:50,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230580080] [2025-02-06 13:22:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:50,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:50,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:50,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:50,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:50,376 INFO L87 Difference]: Start difference. First operand has 110 states, 80 states have (on average 1.5625) internal successors, (125), 97 states have internal predecessors, (125), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-06 13:22:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:50,495 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2025-02-06 13:22:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:50,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2025-02-06 13:22:50,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:50,502 INFO L225 Difference]: With dead ends: 258 [2025-02-06 13:22:50,503 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 13:22:50,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:50,507 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 63 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:50,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 345 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 13:22:50,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2025-02-06 13:22:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 105 states have (on average 1.457142857142857) internal successors, (153), 117 states have internal predecessors, (153), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 168 transitions. [2025-02-06 13:22:50,546 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 168 transitions. Word has length 9 [2025-02-06 13:22:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:50,546 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 168 transitions. [2025-02-06 13:22:50,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-06 13:22:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 168 transitions. [2025-02-06 13:22:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:22:50,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:50,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:50,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:22:50,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:50,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1218472053, now seen corresponding path program 1 times [2025-02-06 13:22:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:50,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658521868] [2025-02-06 13:22:50,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:50,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:22:50,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:22:50,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:50,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:22:50,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:50,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658521868] [2025-02-06 13:22:50,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658521868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:50,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:50,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:22:50,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913740250] [2025-02-06 13:22:50,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:50,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:50,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:50,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:50,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:50,595 INFO L87 Difference]: Start difference. First operand 129 states and 168 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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-06 13:22:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:50,644 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2025-02-06 13:22:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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 14 [2025-02-06 13:22:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:50,646 INFO L225 Difference]: With dead ends: 129 [2025-02-06 13:22:50,646 INFO L226 Difference]: Without dead ends: 128 [2025-02-06 13:22:50,646 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-06 13:22:50,647 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:50,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 199 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-06 13:22:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-02-06 13:22:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.438095238095238) internal successors, (151), 116 states have internal predecessors, (151), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 166 transitions. [2025-02-06 13:22:50,659 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 166 transitions. Word has length 14 [2025-02-06 13:22:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:50,659 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 166 transitions. [2025-02-06 13:22:50,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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-06 13:22:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2025-02-06 13:22:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:22:50,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:50,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:50,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:22:50,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1218458148, now seen corresponding path program 1 times [2025-02-06 13:22:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104580358] [2025-02-06 13:22:50,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:50,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:22:50,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:22:50,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:50,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:50,725 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-06 13:22:50,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:50,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104580358] [2025-02-06 13:22:50,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104580358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:50,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:50,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749694798] [2025-02-06 13:22:50,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:50,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:50,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:50,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:50,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:50,727 INFO L87 Difference]: Start difference. First operand 128 states and 166 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 13:22:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:50,769 INFO L93 Difference]: Finished difference Result 236 states and 305 transitions. [2025-02-06 13:22:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2025-02-06 13:22:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:50,770 INFO L225 Difference]: With dead ends: 236 [2025-02-06 13:22:50,770 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 13:22:50,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:50,771 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:50,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 201 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 13:22:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2025-02-06 13:22:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 116 states have internal predecessors, (149), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2025-02-06 13:22:50,782 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 14 [2025-02-06 13:22:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:50,782 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2025-02-06 13:22:50,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-06 13:22:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2025-02-06 13:22:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:22:50,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:50,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:50,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:22:50,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:50,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash 882072013, now seen corresponding path program 1 times [2025-02-06 13:22:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:50,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907254752] [2025-02-06 13:22:50,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:50,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:50,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:50,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:50,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:50,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:50,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907254752] [2025-02-06 13:22:50,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907254752] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:50,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141539785] [2025-02-06 13:22:50,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:50,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:50,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:50,883 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-06 13:22:50,884 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-06 13:22:50,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:50,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:50,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:50,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:50,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:22:50,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:50,966 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-06 13:22:50,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:50,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141539785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:50,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:50,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 13:22:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256996841] [2025-02-06 13:22:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:50,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:50,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:50,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:50,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:50,969 INFO L87 Difference]: Start difference. First operand 128 states and 164 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, (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-06 13:22:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:51,019 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2025-02-06 13:22:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:51,019 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, (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 15 [2025-02-06 13:22:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:51,020 INFO L225 Difference]: With dead ends: 136 [2025-02-06 13:22:51,020 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 13:22:51,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-06 13:22:51,021 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:51,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 183 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 13:22:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2025-02-06 13:22:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.411214953271028) internal successors, (151), 118 states have internal predecessors, (151), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2025-02-06 13:22:51,037 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 15 [2025-02-06 13:22:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:51,037 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2025-02-06 13:22:51,037 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, (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-06 13:22:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2025-02-06 13:22:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:22:51,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:22:51,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:51,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:51,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash 882653995, now seen corresponding path program 1 times [2025-02-06 13:22:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934319897] [2025-02-06 13:22:51,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:51,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:51,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:51,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:51,304 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-06 13:22:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934319897] [2025-02-06 13:22:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934319897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479879831] [2025-02-06 13:22:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:51,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:51,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:51,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:51,305 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-06 13:22:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:51,413 INFO L93 Difference]: Finished difference Result 249 states and 313 transitions. [2025-02-06 13:22:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:51,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2025-02-06 13:22:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:51,415 INFO L225 Difference]: With dead ends: 249 [2025-02-06 13:22:51,415 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 13:22:51,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:22:51,416 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 88 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:51,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 382 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 13:22:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2025-02-06 13:22:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 128 states have internal predecessors, (162), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2025-02-06 13:22:51,433 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 15 [2025-02-06 13:22:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:51,434 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2025-02-06 13:22:51,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-06 13:22:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2025-02-06 13:22:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:22:51,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,435 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:22:51,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:51,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 542404441, now seen corresponding path program 1 times [2025-02-06 13:22:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687543330] [2025-02-06 13:22:51,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:22:51,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:22:51,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:51,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:51,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:51,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687543330] [2025-02-06 13:22:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687543330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777670027] [2025-02-06 13:22:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:51,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:51,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:51,509 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:51,585 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2025-02-06 13:22:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:51,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-06 13:22:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:51,587 INFO L225 Difference]: With dead ends: 183 [2025-02-06 13:22:51,587 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 13:22:51,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-06 13:22:51,588 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 63 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:51,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 363 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 13:22:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2025-02-06 13:22:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 150 states have internal predecessors, (192), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 207 transitions. [2025-02-06 13:22:51,598 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 207 transitions. Word has length 17 [2025-02-06 13:22:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:51,598 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 207 transitions. [2025-02-06 13:22:51,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 207 transitions. [2025-02-06 13:22:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:22:51,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,599 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:22:51,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:51,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash 543696439, now seen corresponding path program 1 times [2025-02-06 13:22:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288776816] [2025-02-06 13:22:51,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:22:51,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:22:51,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:51,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:51,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:51,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288776816] [2025-02-06 13:22:51,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288776816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:51,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:51,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226915860] [2025-02-06 13:22:51,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:51,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:51,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:51,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:51,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:51,644 INFO L87 Difference]: Start difference. First operand 163 states and 207 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:51,711 INFO L93 Difference]: Finished difference Result 173 states and 216 transitions. [2025-02-06 13:22:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-06 13:22:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:51,712 INFO L225 Difference]: With dead ends: 173 [2025-02-06 13:22:51,712 INFO L226 Difference]: Without dead ends: 172 [2025-02-06 13:22:51,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-06 13:22:51,713 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 51 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:51,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 375 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-06 13:22:51,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2025-02-06 13:22:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 140 states have (on average 1.3642857142857143) internal successors, (191), 150 states have internal predecessors, (191), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2025-02-06 13:22:51,721 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 17 [2025-02-06 13:22:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:51,721 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2025-02-06 13:22:51,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2025-02-06 13:22:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 13:22:51,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:22:51,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:51,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash -337037308, now seen corresponding path program 1 times [2025-02-06 13:22:51,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359811907] [2025-02-06 13:22:51,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:22:51,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:22:51,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:51,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:22:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:51,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359811907] [2025-02-06 13:22:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359811907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:51,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18970424] [2025-02-06 13:22:51,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:51,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:51,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:51,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:51,763 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (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-06 13:22:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:51,801 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2025-02-06 13:22:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:51,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (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 20 [2025-02-06 13:22:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:51,803 INFO L225 Difference]: With dead ends: 165 [2025-02-06 13:22:51,803 INFO L226 Difference]: Without dead ends: 164 [2025-02-06 13:22:51,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:51,804 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:51,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 190 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-06 13:22:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2025-02-06 13:22:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 135 states have (on average 1.348148148148148) internal successors, (182), 144 states have internal predecessors, (182), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2025-02-06 13:22:51,811 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 20 [2025-02-06 13:22:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:51,811 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2025-02-06 13:22:51,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (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-06 13:22:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2025-02-06 13:22:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:22:51,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,812 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:22:51,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:51,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash 677991656, now seen corresponding path program 1 times [2025-02-06 13:22:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651515934] [2025-02-06 13:22:51,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:51,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:51,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:51,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:22:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651515934] [2025-02-06 13:22:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651515934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397996779] [2025-02-06 13:22:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:51,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:51,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:51,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:51,872 INFO L87 Difference]: Start difference. First operand 157 states and 197 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 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-06 13:22:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:51,958 INFO L93 Difference]: Finished difference Result 166 states and 207 transitions. [2025-02-06 13:22:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:51,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 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 24 [2025-02-06 13:22:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:51,961 INFO L225 Difference]: With dead ends: 166 [2025-02-06 13:22:51,961 INFO L226 Difference]: Without dead ends: 164 [2025-02-06 13:22:51,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-06 13:22:51,961 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 61 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:51,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 360 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-06 13:22:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2025-02-06 13:22:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 138 states have internal predecessors, (175), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2025-02-06 13:22:51,974 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 24 [2025-02-06 13:22:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:51,974 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2025-02-06 13:22:51,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 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-06 13:22:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2025-02-06 13:22:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:22:51,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,975 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:22:51,975 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:51,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash 679283654, now seen corresponding path program 1 times [2025-02-06 13:22:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062782177] [2025-02-06 13:22:51,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:51,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:51,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:51,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:22:52,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062782177] [2025-02-06 13:22:52,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062782177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:52,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:52,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:52,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916760557] [2025-02-06 13:22:52,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:52,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:52,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:52,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:52,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:52,009 INFO L87 Difference]: Start difference. First operand 151 states and 190 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 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-06 13:22:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:52,073 INFO L93 Difference]: Finished difference Result 159 states and 199 transitions. [2025-02-06 13:22:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 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 24 [2025-02-06 13:22:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:52,075 INFO L225 Difference]: With dead ends: 159 [2025-02-06 13:22:52,075 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 13:22:52,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-06 13:22:52,075 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 48 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:52,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 372 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 13:22:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2025-02-06 13:22:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 137 states have internal predecessors, (174), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2025-02-06 13:22:52,082 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 24 [2025-02-06 13:22:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:52,083 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2025-02-06 13:22:52,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 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-06 13:22:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2025-02-06 13:22:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 13:22:52,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:52,084 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:52,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:22:52,084 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:52,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1553047316, now seen corresponding path program 1 times [2025-02-06 13:22:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337418873] [2025-02-06 13:22:52,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:52,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 13:22:52,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:22:52,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:52,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:22:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337418873] [2025-02-06 13:22:52,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337418873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156370390] [2025-02-06 13:22:52,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:52,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:52,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:52,291 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-06 13:22:52,295 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-06 13:22:52,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 13:22:52,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 13:22:52,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:52,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:22:52,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:22:52,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:52,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156370390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:52,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:52,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-02-06 13:22:52,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911334406] [2025-02-06 13:22:52,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:52,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:52,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:52,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:52,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:22:52,400 INFO L87 Difference]: Start difference. First operand 150 states and 189 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:52,473 INFO L93 Difference]: Finished difference Result 150 states and 189 transitions. [2025-02-06 13:22:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2025-02-06 13:22:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:52,475 INFO L225 Difference]: With dead ends: 150 [2025-02-06 13:22:52,475 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 13:22:52,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:22:52,477 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:52,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 362 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 13:22:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-02-06 13:22:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 136 states have internal predecessors, (173), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 13:22:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 188 transitions. [2025-02-06 13:22:52,486 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 188 transitions. Word has length 41 [2025-02-06 13:22:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:52,487 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 188 transitions. [2025-02-06 13:22:52,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 188 transitions. [2025-02-06 13:22:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 13:22:52,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:52,488 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:52,496 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-06 13:22:52,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:52,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:52,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash 899826622, now seen corresponding path program 1 times [2025-02-06 13:22:52,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:52,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113305403] [2025-02-06 13:22:52,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:52,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 13:22:52,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 13:22:52,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:52,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:22:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:52,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113305403] [2025-02-06 13:22:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113305403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99687450] [2025-02-06 13:22:52,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:52,847 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-06 13:22:52,848 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-06 13:22:52,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 13:22:52,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 13:22:52,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:52,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 13:22:52,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:22:52,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99687450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 13 [2025-02-06 13:22:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2482664] [2025-02-06 13:22:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:52,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:22:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:52,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:22:52,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:22:52,959 INFO L87 Difference]: Start difference. First operand 149 states and 188 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 13:22:53,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,042 INFO L93 Difference]: Finished difference Result 226 states and 284 transitions. [2025-02-06 13:22:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:22:53,042 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2025-02-06 13:22:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:53,043 INFO L225 Difference]: With dead ends: 226 [2025-02-06 13:22:53,043 INFO L226 Difference]: Without dead ends: 164 [2025-02-06 13:22:53,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:22:53,044 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 10 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:53,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 668 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-06 13:22:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 157. [2025-02-06 13:22:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 143 states have internal predecessors, (178), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-06 13:22:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2025-02-06 13:22:53,052 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 42 [2025-02-06 13:22:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:53,052 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2025-02-06 13:22:53,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 13:22:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2025-02-06 13:22:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 13:22:53,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:53,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:53,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 13:22:53,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:53,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:53,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1765347645, now seen corresponding path program 1 times [2025-02-06 13:22:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:53,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935895062] [2025-02-06 13:22:53,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:53,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 13:22:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:22:53,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:53,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 13:22:53,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:53,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935895062] [2025-02-06 13:22:53,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935895062] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:53,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485025620] [2025-02-06 13:22:53,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:53,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:53,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:53,392 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-06 13:22:53,394 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-06 13:22:53,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 13:22:53,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:22:53,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:53,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:22:53,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:22:53,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:53,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485025620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:53,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:53,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-02-06 13:22:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070670466] [2025-02-06 13:22:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:53,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:53,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:53,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:53,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:22:53,595 INFO L87 Difference]: Start difference. First operand 157 states and 197 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 13:22:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,648 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2025-02-06 13:22:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-02-06 13:22:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:53,649 INFO L225 Difference]: With dead ends: 157 [2025-02-06 13:22:53,650 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 13:22:53,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:22:53,650 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:53,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 337 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 13:22:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-02-06 13:22:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 136 states have (on average 1.3014705882352942) internal successors, (177), 142 states have internal predecessors, (177), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-06 13:22:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 196 transitions. [2025-02-06 13:22:53,658 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 196 transitions. Word has length 46 [2025-02-06 13:22:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:53,658 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 196 transitions. [2025-02-06 13:22:53,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 13:22:53,658 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 196 transitions. [2025-02-06 13:22:53,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 13:22:53,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:53,659 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:53,665 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-06 13:22:53,859 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,SelfDestructingSolverStorable12 [2025-02-06 13:22:53,860 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:53,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:53,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1066735984, now seen corresponding path program 1 times [2025-02-06 13:22:53,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:53,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158777043] [2025-02-06 13:22:53,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:53,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:53,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 13:22:53,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 13:22:53,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:53,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 13:22:53,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:53,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158777043] [2025-02-06 13:22:53,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158777043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:53,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:53,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:22:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213792424] [2025-02-06 13:22:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:53,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:53,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:53,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:53,956 INFO L87 Difference]: Start difference. First operand 156 states and 196 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 13:22:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,984 INFO L93 Difference]: Finished difference Result 159 states and 199 transitions. [2025-02-06 13:22:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-02-06 13:22:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:53,986 INFO L225 Difference]: With dead ends: 159 [2025-02-06 13:22:53,986 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 13:22:53,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:53,987 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:53,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 151 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 13:22:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-02-06 13:22:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.286764705882353) internal successors, (175), 140 states have internal predecessors, (175), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-06 13:22:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 194 transitions. [2025-02-06 13:22:53,996 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 194 transitions. Word has length 58 [2025-02-06 13:22:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:53,997 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 194 transitions. [2025-02-06 13:22:53,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 13:22:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 194 transitions. [2025-02-06 13:22:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 13:22:53,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:53,998 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 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-06 13:22:53,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:22:53,998 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:53,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:53,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1290922920, now seen corresponding path program 1 times [2025-02-06 13:22:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109174645] [2025-02-06 13:22:53,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:54,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 13:22:54,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 13:22:54,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:54,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 13:22:54,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109174645] [2025-02-06 13:22:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109174645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727145093] [2025-02-06 13:22:54,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:54,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:54,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:54,130 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-06 13:22:54,132 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-06 13:22:54,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 13:22:54,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 13:22:54,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:54,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:54,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:22:54,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 13:22:54,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727145093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:54,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:54,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-02-06 13:22:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65801295] [2025-02-06 13:22:54,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:54,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:54,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:22:54,240 INFO L87 Difference]: Start difference. First operand 154 states and 194 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 13:22:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:54,274 INFO L93 Difference]: Finished difference Result 165 states and 208 transitions. [2025-02-06 13:22:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:54,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2025-02-06 13:22:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:54,276 INFO L225 Difference]: With dead ends: 165 [2025-02-06 13:22:54,276 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 13:22:54,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:22:54,278 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:54,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 162 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 13:22:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2025-02-06 13:22:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 139 states have (on average 1.2733812949640289) internal successors, (177), 142 states have internal predecessors, (177), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2025-02-06 13:22:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2025-02-06 13:22:54,288 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 59 [2025-02-06 13:22:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:54,288 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2025-02-06 13:22:54,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 13:22:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2025-02-06 13:22:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 13:22:54,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:54,289 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:54,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:22:54,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 13:22:54,490 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:54,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2036207043, now seen corresponding path program 1 times [2025-02-06 13:22:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:54,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050523788] [2025-02-06 13:22:54,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:54,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 13:22:54,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 13:22:54,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:54,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 13:22:54,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050523788] [2025-02-06 13:22:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050523788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:54,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 13:22:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742992369] [2025-02-06 13:22:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:54,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:22:54,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:54,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:22:54,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:22:54,636 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:22:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:54,757 INFO L93 Difference]: Finished difference Result 247 states and 317 transitions. [2025-02-06 13:22:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:22:54,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 75 [2025-02-06 13:22:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:54,758 INFO L225 Difference]: With dead ends: 247 [2025-02-06 13:22:54,758 INFO L226 Difference]: Without dead ends: 195 [2025-02-06 13:22:54,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:22:54,759 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 31 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:54,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 616 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-06 13:22:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 170. [2025-02-06 13:22:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 153 states have internal predecessors, (190), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-06 13:22:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 215 transitions. [2025-02-06 13:22:54,768 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 215 transitions. Word has length 75 [2025-02-06 13:22:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:54,769 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 215 transitions. [2025-02-06 13:22:54,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:22:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2025-02-06 13:22:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 13:22:54,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:54,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:54,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:22:54,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:54,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1260140430, now seen corresponding path program 1 times [2025-02-06 13:22:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:54,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082369252] [2025-02-06 13:22:54,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:54,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 13:22:54,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 13:22:54,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:54,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:54,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082369252] [2025-02-06 13:22:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082369252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899787899] [2025-02-06 13:22:54,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:54,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:54,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:54,894 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-06 13:22:54,895 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-06 13:22:54,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 13:22:54,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 13:22:54,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:54,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:54,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 13:22:54,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 13:22:55,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899787899] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:55,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 13:22:55,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8, 15] total 26 [2025-02-06 13:22:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919862554] [2025-02-06 13:22:55,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:55,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:22:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:55,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:22:55,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2025-02-06 13:22:55,443 INFO L87 Difference]: Start difference. First operand 170 states and 215 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:22:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:55,642 INFO L93 Difference]: Finished difference Result 365 states and 467 transitions. [2025-02-06 13:22:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:22:55,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2025-02-06 13:22:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:55,644 INFO L225 Difference]: With dead ends: 365 [2025-02-06 13:22:55,645 INFO L226 Difference]: Without dead ends: 290 [2025-02-06 13:22:55,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2025-02-06 13:22:55,646 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 186 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:55,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1201 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:22:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-06 13:22:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2025-02-06 13:22:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 245 states have (on average 1.2489795918367348) internal successors, (306), 249 states have internal predecessors, (306), 25 states have call successors, (25), 6 states have call predecessors, (25), 9 states have return successors, (29), 24 states have call predecessors, (29), 23 states have call successors, (29) [2025-02-06 13:22:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 360 transitions. [2025-02-06 13:22:55,661 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 360 transitions. Word has length 76 [2025-02-06 13:22:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:55,661 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 360 transitions. [2025-02-06 13:22:55,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:22:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 360 transitions. [2025-02-06 13:22:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 13:22:55,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:55,662 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 13:22:55,672 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-06 13:22:55,863 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,SelfDestructingSolverStorable16 [2025-02-06 13:22:55,863 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash -819085238, now seen corresponding path program 1 times [2025-02-06 13:22:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403623392] [2025-02-06 13:22:55,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:55,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 13:22:55,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 13:22:55,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:55,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:55,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:55,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403623392] [2025-02-06 13:22:55,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403623392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:55,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:55,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:55,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733832597] [2025-02-06 13:22:55,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:55,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:55,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:55,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:55,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:55,959 INFO L87 Difference]: Start difference. First operand 280 states and 360 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:22:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:56,020 INFO L93 Difference]: Finished difference Result 554 states and 712 transitions. [2025-02-06 13:22:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:56,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2025-02-06 13:22:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:56,022 INFO L225 Difference]: With dead ends: 554 [2025-02-06 13:22:56,022 INFO L226 Difference]: Without dead ends: 303 [2025-02-06 13:22:56,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:56,023 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 11 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:56,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 281 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-06 13:22:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2025-02-06 13:22:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 245 states have (on average 1.236734693877551) internal successors, (303), 249 states have internal predecessors, (303), 25 states have call successors, (25), 6 states have call predecessors, (25), 9 states have return successors, (29), 24 states have call predecessors, (29), 23 states have call successors, (29) [2025-02-06 13:22:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 357 transitions. [2025-02-06 13:22:56,042 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 357 transitions. Word has length 77 [2025-02-06 13:22:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:56,043 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 357 transitions. [2025-02-06 13:22:56,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:22:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 357 transitions. [2025-02-06 13:22:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 13:22:56,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:56,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:56,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 13:22:56,047 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:56,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1883428498, now seen corresponding path program 1 times [2025-02-06 13:22:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:56,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101253871] [2025-02-06 13:22:56,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:56,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 13:22:56,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 13:22:56,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:56,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:56,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101253871] [2025-02-06 13:22:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101253871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:56,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445178927] [2025-02-06 13:22:56,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:56,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:56,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:56,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:56,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:22:56,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 13:22:56,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 13:22:56,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:56,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:56,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:22:56,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:56,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:56,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445178927] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:56,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:56,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-06 13:22:56,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529307253] [2025-02-06 13:22:56,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:56,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:22:56,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:56,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:22:56,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:22:56,404 INFO L87 Difference]: Start difference. First operand 280 states and 357 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 13:22:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:56,546 INFO L93 Difference]: Finished difference Result 471 states and 606 transitions. [2025-02-06 13:22:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:22:56,547 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 68 [2025-02-06 13:22:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:56,548 INFO L225 Difference]: With dead ends: 471 [2025-02-06 13:22:56,548 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 13:22:56,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:22:56,550 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 11 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:56,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1006 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 13:22:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 294. [2025-02-06 13:22:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 255 states have (on average 1.231372549019608) internal successors, (314), 260 states have internal predecessors, (314), 27 states have call successors, (27), 7 states have call predecessors, (27), 11 states have return successors, (33), 26 states have call predecessors, (33), 25 states have call successors, (33) [2025-02-06 13:22:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 374 transitions. [2025-02-06 13:22:56,572 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 374 transitions. Word has length 68 [2025-02-06 13:22:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:56,573 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 374 transitions. [2025-02-06 13:22:56,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 13:22:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 374 transitions. [2025-02-06 13:22:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 13:22:56,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:56,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:56,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:22:56,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:56,776 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:56,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash 710799027, now seen corresponding path program 1 times [2025-02-06 13:22:56,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:56,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530076169] [2025-02-06 13:22:56,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:56,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:56,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 13:22:56,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 13:22:56,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:56,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:56,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:56,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530076169] [2025-02-06 13:22:56,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530076169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:56,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498300304] [2025-02-06 13:22:56,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:56,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:56,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:56,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:56,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:22:56,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 13:22:56,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 13:22:56,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:56,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:56,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 13:22:56,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:57,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:57,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498300304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:57,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:57,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-06 13:22:57,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406426573] [2025-02-06 13:22:57,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:57,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:22:57,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:57,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:22:57,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:22:57,063 INFO L87 Difference]: Start difference. First operand 294 states and 374 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:22:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:57,142 INFO L93 Difference]: Finished difference Result 430 states and 551 transitions. [2025-02-06 13:22:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:22:57,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2025-02-06 13:22:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:57,143 INFO L225 Difference]: With dead ends: 430 [2025-02-06 13:22:57,143 INFO L226 Difference]: Without dead ends: 309 [2025-02-06 13:22:57,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:22:57,144 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 10 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:57,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 660 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-06 13:22:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 299. [2025-02-06 13:22:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 258 states have (on average 1.2286821705426356) internal successors, (317), 264 states have internal predecessors, (317), 28 states have call successors, (28), 7 states have call predecessors, (28), 12 states have return successors, (36), 27 states have call predecessors, (36), 26 states have call successors, (36) [2025-02-06 13:22:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 381 transitions. [2025-02-06 13:22:57,161 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 381 transitions. Word has length 76 [2025-02-06 13:22:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:57,161 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 381 transitions. [2025-02-06 13:22:57,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:22:57,161 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 381 transitions. [2025-02-06 13:22:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 13:22:57,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:57,162 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:57,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 13:22:57,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:57,364 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:57,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1267269572, now seen corresponding path program 2 times [2025-02-06 13:22:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:57,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812178848] [2025-02-06 13:22:57,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:22:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:57,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 13:22:57,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 68 statements. [2025-02-06 13:22:57,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:22:57,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812178848] [2025-02-06 13:22:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812178848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:57,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:57,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 13:22:57,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424700702] [2025-02-06 13:22:57,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:57,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:22:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:57,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:22:57,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:22:57,433 INFO L87 Difference]: Start difference. First operand 299 states and 381 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:22:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:57,501 INFO L93 Difference]: Finished difference Result 483 states and 614 transitions. [2025-02-06 13:22:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:22:57,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2025-02-06 13:22:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:57,503 INFO L225 Difference]: With dead ends: 483 [2025-02-06 13:22:57,503 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 13:22:57,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:22:57,503 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:57,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 702 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 13:22:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 305. [2025-02-06 13:22:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 263 states have (on average 1.2243346007604563) internal successors, (322), 269 states have internal predecessors, (322), 28 states have call successors, (28), 8 states have call predecessors, (28), 13 states have return successors, (34), 27 states have call predecessors, (34), 26 states have call successors, (34) [2025-02-06 13:22:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 384 transitions. [2025-02-06 13:22:57,517 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 384 transitions. Word has length 68 [2025-02-06 13:22:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:57,517 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 384 transitions. [2025-02-06 13:22:57,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:22:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 384 transitions. [2025-02-06 13:22:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 13:22:57,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:57,519 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:57,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 13:22:57,519 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1060902875, now seen corresponding path program 1 times [2025-02-06 13:22:57,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:57,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385313185] [2025-02-06 13:22:57,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:57,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:57,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 13:22:57,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 13:22:57,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:57,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:22:57,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:57,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385313185] [2025-02-06 13:22:57,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385313185] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:57,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310553205] [2025-02-06 13:22:57,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:57,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:57,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:57,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:57,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 13:22:57,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 13:22:57,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 13:22:57,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:57,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:57,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:22:57,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:22:57,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:22:57,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310553205] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:57,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:57,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2025-02-06 13:22:57,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678741451] [2025-02-06 13:22:57,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:57,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 13:22:57,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:57,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 13:22:57,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-06 13:22:57,883 INFO L87 Difference]: Start difference. First operand 305 states and 384 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 13:22:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:58,162 INFO L93 Difference]: Finished difference Result 572 states and 726 transitions. [2025-02-06 13:22:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 13:22:58,164 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 82 [2025-02-06 13:22:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:58,166 INFO L225 Difference]: With dead ends: 572 [2025-02-06 13:22:58,166 INFO L226 Difference]: Without dead ends: 399 [2025-02-06 13:22:58,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:22:58,169 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 149 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:58,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1749 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:22:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-06 13:22:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 375. [2025-02-06 13:22:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 321 states have (on average 1.2274143302180685) internal successors, (394), 329 states have internal predecessors, (394), 37 states have call successors, (37), 9 states have call predecessors, (37), 16 states have return successors, (47), 36 states have call predecessors, (47), 35 states have call successors, (47) [2025-02-06 13:22:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 478 transitions. [2025-02-06 13:22:58,189 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 478 transitions. Word has length 82 [2025-02-06 13:22:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:58,189 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 478 transitions. [2025-02-06 13:22:58,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 11 states have internal predecessors, (69), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 13:22:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 478 transitions. [2025-02-06 13:22:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 13:22:58,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:58,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:58,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 13:22:58,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:58,391 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:58,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1001055542, now seen corresponding path program 1 times [2025-02-06 13:22:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:58,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203886417] [2025-02-06 13:22:58,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:58,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:58,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 13:22:58,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 13:22:58,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:58,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:22:58,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203886417] [2025-02-06 13:22:58,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203886417] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111386535] [2025-02-06 13:22:58,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:58,583 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:58,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 13:22:58,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 13:22:58,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 13:22:58,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:58,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:58,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 13:22:58,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 13:22:58,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:58,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111386535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:58,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:58,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 16 [2025-02-06 13:22:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501381428] [2025-02-06 13:22:58,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:58,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:22:58,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:58,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:22:58,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:22:58,778 INFO L87 Difference]: Start difference. First operand 375 states and 478 transitions. Second operand has 13 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 13:22:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:59,033 INFO L93 Difference]: Finished difference Result 634 states and 811 transitions. [2025-02-06 13:22:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:22:59,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 72 [2025-02-06 13:22:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:59,036 INFO L225 Difference]: With dead ends: 634 [2025-02-06 13:22:59,036 INFO L226 Difference]: Without dead ends: 380 [2025-02-06 13:22:59,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:22:59,037 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 115 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:59,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1159 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:22:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-06 13:22:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 370. [2025-02-06 13:22:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 318 states have (on average 1.229559748427673) internal successors, (391), 325 states have internal predecessors, (391), 36 states have call successors, (36), 9 states have call predecessors, (36), 15 states have return successors, (44), 35 states have call predecessors, (44), 34 states have call successors, (44) [2025-02-06 13:22:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 471 transitions. [2025-02-06 13:22:59,054 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 471 transitions. Word has length 72 [2025-02-06 13:22:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:59,055 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 471 transitions. [2025-02-06 13:22:59,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 13:22:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 471 transitions. [2025-02-06 13:22:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 13:22:59,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:59,057 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:59,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 13:22:59,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 13:22:59,262 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:22:59,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:59,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2112143283, now seen corresponding path program 2 times [2025-02-06 13:22:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:59,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883861225] [2025-02-06 13:22:59,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:22:59,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:59,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-06 13:22:59,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 13:22:59,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:22:59,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883861225] [2025-02-06 13:22:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883861225] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082346214] [2025-02-06 13:22:59,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:22:59,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:59,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:59,400 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:59,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 13:22:59,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-06 13:22:59,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 13:22:59,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:22:59,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:59,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 13:22:59,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 13:22:59,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:22:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082346214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:59,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2025-02-06 13:22:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388983332] [2025-02-06 13:22:59,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:59,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:22:59,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:59,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:22:59,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:22:59,598 INFO L87 Difference]: Start difference. First operand 370 states and 471 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 13:22:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:59,817 INFO L93 Difference]: Finished difference Result 753 states and 955 transitions. [2025-02-06 13:22:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 13:22:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 76 [2025-02-06 13:22:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:59,819 INFO L225 Difference]: With dead ends: 753 [2025-02-06 13:22:59,819 INFO L226 Difference]: Without dead ends: 350 [2025-02-06 13:22:59,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-02-06 13:22:59,820 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 22 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:59,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 938 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-06 13:22:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 320. [2025-02-06 13:22:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 274 states have (on average 1.2262773722627738) internal successors, (336), 279 states have internal predecessors, (336), 33 states have call successors, (33), 8 states have call predecessors, (33), 12 states have return successors, (38), 32 states have call predecessors, (38), 31 states have call successors, (38) [2025-02-06 13:22:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 407 transitions. [2025-02-06 13:22:59,832 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 407 transitions. Word has length 76 [2025-02-06 13:22:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:59,833 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 407 transitions. [2025-02-06 13:22:59,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 12 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 13:22:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 407 transitions. [2025-02-06 13:22:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 13:22:59,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:59,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:59,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 13:23:00,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 13:23:00,038 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:23:00,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:00,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1880943479, now seen corresponding path program 2 times [2025-02-06 13:23:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:00,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470718093] [2025-02-06 13:23:00,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:23:00,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:00,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-02-06 13:23:00,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 82 statements. [2025-02-06 13:23:00,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:23:00,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:23:00,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:00,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470718093] [2025-02-06 13:23:00,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470718093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:00,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:00,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 13:23:00,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074613339] [2025-02-06 13:23:00,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:00,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:23:00,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:00,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:23:00,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:23:00,195 INFO L87 Difference]: Start difference. First operand 320 states and 407 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:23:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:00,444 INFO L93 Difference]: Finished difference Result 531 states and 677 transitions. [2025-02-06 13:23:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:23:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2025-02-06 13:23:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:00,446 INFO L225 Difference]: With dead ends: 531 [2025-02-06 13:23:00,446 INFO L226 Difference]: Without dead ends: 428 [2025-02-06 13:23:00,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:23:00,447 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 125 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:00,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1559 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:23:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-06 13:23:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 362. [2025-02-06 13:23:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 312 states have (on average 1.233974358974359) internal successors, (385), 316 states have internal predecessors, (385), 37 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2025-02-06 13:23:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 462 transitions. [2025-02-06 13:23:00,466 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 462 transitions. Word has length 82 [2025-02-06 13:23:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:00,466 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 462 transitions. [2025-02-06 13:23:00,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:23:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 462 transitions. [2025-02-06 13:23:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 13:23:00,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:00,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:00,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 13:23:00,468 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:23:00,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash -286191863, now seen corresponding path program 3 times [2025-02-06 13:23:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923229777] [2025-02-06 13:23:00,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:23:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:00,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 76 statements into 3 equivalence classes. [2025-02-06 13:23:00,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 62 of 76 statements. [2025-02-06 13:23:00,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 13:23:00,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:23:00,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:00,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923229777] [2025-02-06 13:23:00,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923229777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:00,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:00,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 13:23:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090097807] [2025-02-06 13:23:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:00,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 13:23:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:00,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 13:23:00,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:23:00,897 INFO L87 Difference]: Start difference. First operand 362 states and 462 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:23:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:01,182 INFO L93 Difference]: Finished difference Result 512 states and 656 transitions. [2025-02-06 13:23:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 13:23:01,182 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2025-02-06 13:23:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:01,184 INFO L225 Difference]: With dead ends: 512 [2025-02-06 13:23:01,184 INFO L226 Difference]: Without dead ends: 451 [2025-02-06 13:23:01,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:23:01,185 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 159 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:01,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 921 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:23:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-02-06 13:23:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 374. [2025-02-06 13:23:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 323 states have (on average 1.2321981424148607) internal successors, (398), 326 states have internal predecessors, (398), 38 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (40), 37 states have call predecessors, (40), 35 states have call successors, (40) [2025-02-06 13:23:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 476 transitions. [2025-02-06 13:23:01,201 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 476 transitions. Word has length 76 [2025-02-06 13:23:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:01,201 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 476 transitions. [2025-02-06 13:23:01,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:23:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 476 transitions. [2025-02-06 13:23:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 13:23:01,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:01,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:01,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 13:23:01,205 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:23:01,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:01,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1208875446, now seen corresponding path program 1 times [2025-02-06 13:23:01,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:01,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55631096] [2025-02-06 13:23:01,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:01,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:01,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 13:23:01,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 13:23:01,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:01,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:23:01,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:01,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55631096] [2025-02-06 13:23:01,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55631096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:01,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:01,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:23:01,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813537582] [2025-02-06 13:23:01,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:01,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:23:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:01,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:23:01,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:23:01,321 INFO L87 Difference]: Start difference. First operand 374 states and 476 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:23:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:01,403 INFO L93 Difference]: Finished difference Result 453 states and 571 transitions. [2025-02-06 13:23:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:23:01,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2025-02-06 13:23:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:01,405 INFO L225 Difference]: With dead ends: 453 [2025-02-06 13:23:01,405 INFO L226 Difference]: Without dead ends: 403 [2025-02-06 13:23:01,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:23:01,406 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 37 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:01,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 742 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:23:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-06 13:23:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 374. [2025-02-06 13:23:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 323 states have (on average 1.2291021671826625) internal successors, (397), 326 states have internal predecessors, (397), 38 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (40), 37 states have call predecessors, (40), 35 states have call successors, (40) [2025-02-06 13:23:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 475 transitions. [2025-02-06 13:23:01,420 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 475 transitions. Word has length 76 [2025-02-06 13:23:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:01,420 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 475 transitions. [2025-02-06 13:23:01,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:23:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 475 transitions. [2025-02-06 13:23:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 13:23:01,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:01,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:01,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 13:23:01,422 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:23:01,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:01,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1945660049, now seen corresponding path program 1 times [2025-02-06 13:23:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:01,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277272764] [2025-02-06 13:23:01,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:01,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:01,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 13:23:01,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 13:23:01,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:01,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 13:23:01,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:01,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277272764] [2025-02-06 13:23:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277272764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:01,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:01,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 13:23:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069982227] [2025-02-06 13:23:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:01,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:23:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:01,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:23:01,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:23:01,522 INFO L87 Difference]: Start difference. First operand 374 states and 475 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:23:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:01,592 INFO L93 Difference]: Finished difference Result 407 states and 513 transitions. [2025-02-06 13:23:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:23:01,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 77 [2025-02-06 13:23:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:01,594 INFO L225 Difference]: With dead ends: 407 [2025-02-06 13:23:01,594 INFO L226 Difference]: Without dead ends: 351 [2025-02-06 13:23:01,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:23:01,595 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 2 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:01,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 745 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:23:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-02-06 13:23:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-02-06 13:23:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 304 states have (on average 1.2335526315789473) internal successors, (375), 307 states have internal predecessors, (375), 36 states have call successors, (36), 8 states have call predecessors, (36), 10 states have return successors, (37), 35 states have call predecessors, (37), 34 states have call successors, (37) [2025-02-06 13:23:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 448 transitions. [2025-02-06 13:23:01,609 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 448 transitions. Word has length 77 [2025-02-06 13:23:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:01,609 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 448 transitions. [2025-02-06 13:23:01,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 13:23:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 448 transitions. [2025-02-06 13:23:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 13:23:01,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:01,611 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:01,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 13:23:01,611 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:23:01,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 958259896, now seen corresponding path program 1 times [2025-02-06 13:23:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028925935] [2025-02-06 13:23:01,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:23:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:01,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 13:23:01,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 13:23:01,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:23:01,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 13:23:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028925935] [2025-02-06 13:23:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028925935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 13:23:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598373143] [2025-02-06 13:23:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:01,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:23:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:23:01,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:23:01,783 INFO L87 Difference]: Start difference. First operand 351 states and 448 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:23:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:01,934 INFO L93 Difference]: Finished difference Result 450 states and 577 transitions. [2025-02-06 13:23:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:23:01,934 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2025-02-06 13:23:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:01,936 INFO L225 Difference]: With dead ends: 450 [2025-02-06 13:23:01,936 INFO L226 Difference]: Without dead ends: 345 [2025-02-06 13:23:01,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 13:23:01,936 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 64 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:01,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1116 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:23:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-06 13:23:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 338. [2025-02-06 13:23:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 293 states have (on average 1.2320819112627985) internal successors, (361), 296 states have internal predecessors, (361), 34 states have call successors, (34), 8 states have call predecessors, (34), 10 states have return successors, (35), 33 states have call predecessors, (35), 32 states have call successors, (35) [2025-02-06 13:23:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 430 transitions. [2025-02-06 13:23:01,948 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 430 transitions. Word has length 82 [2025-02-06 13:23:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:01,949 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 430 transitions. [2025-02-06 13:23:01,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 13:23:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 430 transitions. [2025-02-06 13:23:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 13:23:01,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:01,950 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:01,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 13:23:01,950 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-06 13:23:01,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash 138219292, now seen corresponding path program 2 times [2025-02-06 13:23:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:01,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518867605] [2025-02-06 13:23:01,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:23:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:01,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-02-06 13:23:01,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 13:23:01,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:23:01,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 13:23:02,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:02,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518867605] [2025-02-06 13:23:02,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518867605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:23:02,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:23:02,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:23:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399619964] [2025-02-06 13:23:02,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:23:02,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:23:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:02,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:23:02,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:23:02,158 INFO L87 Difference]: Start difference. First operand 338 states and 430 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 13:23:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:02,222 INFO L93 Difference]: Finished difference Result 358 states and 458 transitions. [2025-02-06 13:23:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:23:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2025-02-06 13:23:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:02,227 INFO L225 Difference]: With dead ends: 358 [2025-02-06 13:23:02,227 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:23:02,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:23:02,228 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 22 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:02,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 262 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:23:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:23:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:23:02,230 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-06 13:23:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:23:02,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2025-02-06 13:23:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:02,230 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:23:02,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 13:23:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:23:02,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:23:02,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-06 13:23:02,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-06 13:23:02,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-06 13:23:02,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-06 13:23:02,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-06 13:23:02,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-06 13:23:02,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-06 13:23:02,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-06 13:23:02,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-06 13:23:02,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-06 13:23:02,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-06 13:23:02,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-06 13:23:02,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-06 13:23:02,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-06 13:23:02,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-06 13:23:02,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-06 13:23:02,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 13:23:02,236 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2025-02-06 13:23:02,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:23:03,805 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:23:03,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:23:03 BoogieIcfgContainer [2025-02-06 13:23:03,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:23:03,815 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:23:03,815 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:23:03,815 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:23:03,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:50" (3/4) ... [2025-02-06 13:23:03,817 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:23:03,821 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-02-06 13:23:03,821 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure addflt [2025-02-06 13:23:03,821 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 13:23:03,825 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-06 13:23:03,825 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 13:23:03,825 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 13:23:03,825 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:23:03,843 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (m <= 16777215)) && (e <= 127)) [2025-02-06 13:23:03,843 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) [2025-02-06 13:23:03,863 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) [2025-02-06 13:23:03,863 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (m <= 16777215)) && (e <= 127)) [2025-02-06 13:23:03,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:23:03,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:23:03,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:23:03,891 INFO L158 Benchmark]: Toolchain (without parser) took 14521.03ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 123.8MB in the beginning and 214.0MB in the end (delta: -90.3MB). Peak memory consumption was 161.2MB. Max. memory is 16.1GB. [2025-02-06 13:23:03,891 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:23:03,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.44ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 110.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:23:03,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.49ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 109.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:23:03,893 INFO L158 Benchmark]: Boogie Preprocessor took 25.67ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 108.1MB in the end (delta: 962.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:23:03,894 INFO L158 Benchmark]: IcfgBuilder took 486.61ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 83.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 13:23:03,894 INFO L158 Benchmark]: TraceAbstraction took 13713.12ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 82.0MB in the beginning and 222.2MB in the end (delta: -140.1MB). Peak memory consumption was 200.2MB. Max. memory is 16.1GB. [2025-02-06 13:23:03,894 INFO L158 Benchmark]: Witness Printer took 75.85ms. Allocated memory is still 419.4MB. Free memory was 222.2MB in the beginning and 214.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:23:03,895 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.44ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 110.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.49ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 109.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.67ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 108.1MB in the end (delta: 962.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 486.61ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 83.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13713.12ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 82.0MB in the beginning and 222.2MB in the end (delta: -140.1MB). Peak memory consumption was 200.2MB. Max. memory is 16.1GB. * Witness Printer took 75.85ms. Allocated memory is still 419.4MB. Free memory was 222.2MB in the beginning and 214.0MB in the end (delta: 8.1MB). 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: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: 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 4 procedures, 110 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 30, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1468 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1418 mSDsluCounter, 18307 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15073 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4063 IncrementalHoareTripleChecker+Invalid, 4170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 3234 mSDtfsCounter, 4063 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1212 GetRequests, 948 SyntacticMatches, 2 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=22, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 427 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2213 NumberOfCodeBlocks, 2111 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2470 ConstructedInterpolants, 0 QuantifiedInterpolants, 4464 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1851 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 45 InterpolantComputations, 27 PerfectInterpolantSequences, 846/910 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 16 specifications checked. All of them hold - InvariantResult [Line: 37]: Location Invariant Derived location invariant: (((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (m <= 16777215)) && (e <= 127)) - InvariantResult [Line: 57]: Location Invariant Derived location invariant: ((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:23:03,916 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