./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_3.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_3.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 aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:22:32,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:22:32,919 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:32,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:22:32,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:22:32,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:22:32,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:22:32,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:22:32,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:22:32,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:22:32,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:22:32,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:22:32,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:22:32,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:22:32,979 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:22:32,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:22:32,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:22:32,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:22:32,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:22:32,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:22:32,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:22:32,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:22:32,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:22:32,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:22:32,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:32,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:22:32,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:22:32,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:22:32,985 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 -> aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 [2025-02-06 13:22:33,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:22:33,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:22:33,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:22:33,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:22:33,390 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:22:33,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2025-02-06 13:22:33,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/840481f86/b46828ba98554ff9ab42ee696ca5add6/FLAG50810fd5a [2025-02-06 13:22:35,612 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:22:35,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2025-02-06 13:22:35,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/840481f86/b46828ba98554ff9ab42ee696ca5add6/FLAG50810fd5a [2025-02-06 13:22:35,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/840481f86/b46828ba98554ff9ab42ee696ca5add6 [2025-02-06 13:22:35,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:22:35,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:22:35,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:35,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:22:35,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:22:35,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:35" (1/1) ... [2025-02-06 13:22:35,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aec322e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:35, skipping insertion in model container [2025-02-06 13:22:35,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:35" (1/1) ... [2025-02-06 13:22:35,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:22:35,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:35,849 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:22:35,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:35,885 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:22:35,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:35 WrapperNode [2025-02-06 13:22:35,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:35,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:35,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:22:35,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:22:35,897 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:35" (1/1) ... [2025-02-06 13:22:35,903 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:35" (1/1) ... [2025-02-06 13:22:35,927 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2025-02-06 13:22:35,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:35,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:22:35,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:22:35,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:22:35,934 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:35" (1/1) ... [2025-02-06 13:22:35,934 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:35" (1/1) ... [2025-02-06 13:22:35,936 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:35" (1/1) ... [2025-02-06 13:22:35,944 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:35,944 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:35" (1/1) ... [2025-02-06 13:22:35,944 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:35" (1/1) ... [2025-02-06 13:22:35,947 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:35" (1/1) ... [2025-02-06 13:22:35,948 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:35" (1/1) ... [2025-02-06 13:22:35,948 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:35" (1/1) ... [2025-02-06 13:22:35,949 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:35" (1/1) ... [2025-02-06 13:22:35,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:22:35,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:22:35,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:22:35,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:22:35,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:35" (1/1) ... [2025-02-06 13:22:35,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:35,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:35,974 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:35,978 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:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:22:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:22:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-06 13:22:35,991 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-06 13:22:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:22:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:22:35,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 13:22:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 13:22:36,036 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:22:36,037 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:22:36,308 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-06 13:22:36,308 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:22:36,326 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:22:36,327 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:22:36,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:36 BoogieIcfgContainer [2025-02-06 13:22:36,327 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:22:36,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:22:36,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:22:36,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:22:36,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:22:35" (1/3) ... [2025-02-06 13:22:36,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468cdc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:36, skipping insertion in model container [2025-02-06 13:22:36,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:35" (2/3) ... [2025-02-06 13:22:36,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468cdc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:36, skipping insertion in model container [2025-02-06 13:22:36,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:36" (3/3) ... [2025-02-06 13:22:36,335 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_3.c.cil.c [2025-02-06 13:22:36,345 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:22:36,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_3.c.cil.c that has 3 procedures, 123 locations, 1 initial locations, 2 loop locations, and 24 error locations. [2025-02-06 13:22:36,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:22:36,399 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;@4cd94a7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:22:36,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-06 13:22:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 90 states have (on average 1.6333333333333333) internal successors, (147), 116 states have internal predecessors, (147), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 13:22:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:22:36,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:36,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:36,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:36,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash 127980740, now seen corresponding path program 1 times [2025-02-06 13:22:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:36,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156826383] [2025-02-06 13:22:36,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:36,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:36,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:22:36,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:22:36,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:36,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:36,593 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:36,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:36,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156826383] [2025-02-06 13:22:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156826383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:36,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:36,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119617759] [2025-02-06 13:22:36,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:36,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:36,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:36,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:36,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:36,614 INFO L87 Difference]: Start difference. First operand has 123 states, 90 states have (on average 1.6333333333333333) internal successors, (147), 116 states have internal predecessors, (147), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:36,757 INFO L93 Difference]: Finished difference Result 290 states and 385 transitions. [2025-02-06 13:22:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:36,758 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:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:36,763 INFO L225 Difference]: With dead ends: 290 [2025-02-06 13:22:36,764 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 13:22:36,766 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:36,769 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:36,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 378 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 13:22:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 132. [2025-02-06 13:22:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 106 states have (on average 1.490566037735849) internal successors, (158), 125 states have internal predecessors, (158), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2025-02-06 13:22:36,821 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 9 [2025-02-06 13:22:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:36,823 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2025-02-06 13:22:36,823 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:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2025-02-06 13:22:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:22:36,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:36,827 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:36,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:22:36,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:36,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash -837052289, now seen corresponding path program 1 times [2025-02-06 13:22:36,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:36,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474655195] [2025-02-06 13:22:36,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:36,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:36,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:22:36,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:22:36,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:36,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:36,908 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:36,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:36,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474655195] [2025-02-06 13:22:36,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474655195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:36,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:36,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:22:36,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141961390] [2025-02-06 13:22:36,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:36,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:36,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:36,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:36,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:36,913 INFO L87 Difference]: Start difference. First operand 132 states and 166 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:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:36,980 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2025-02-06 13:22:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:36,980 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:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:36,981 INFO L225 Difference]: With dead ends: 132 [2025-02-06 13:22:36,981 INFO L226 Difference]: Without dead ends: 131 [2025-02-06 13:22:36,982 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:36,982 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:36,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-06 13:22:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-06 13:22:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.471698113207547) internal successors, (156), 124 states have internal predecessors, (156), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2025-02-06 13:22:37,000 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 14 [2025-02-06 13:22:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:37,001 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2025-02-06 13:22:37,001 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:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2025-02-06 13:22:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:22:37,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:37,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:37,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:22:37,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:37,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash -837038384, now seen corresponding path program 1 times [2025-02-06 13:22:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:37,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458355026] [2025-02-06 13:22:37,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:37,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:22:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:22:37,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:37,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:37,077 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:37,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458355026] [2025-02-06 13:22:37,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458355026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:37,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:37,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467134790] [2025-02-06 13:22:37,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:37,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:37,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:37,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:37,082 INFO L87 Difference]: Start difference. First operand 131 states and 164 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:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:37,146 INFO L93 Difference]: Finished difference Result 267 states and 338 transitions. [2025-02-06 13:22:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:37,147 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:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:37,148 INFO L225 Difference]: With dead ends: 267 [2025-02-06 13:22:37,148 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 13:22:37,149 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:37,154 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:37,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 191 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 13:22:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2025-02-06 13:22:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.4528301886792452) internal successors, (154), 124 states have internal predecessors, (154), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2025-02-06 13:22:37,167 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 14 [2025-02-06 13:22:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2025-02-06 13:22:37,168 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:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2025-02-06 13:22:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:22:37,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:37,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:37,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:22:37,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:37,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:37,169 INFO L85 PathProgramCache]: Analyzing trace with hash -178817185, now seen corresponding path program 1 times [2025-02-06 13:22:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848582008] [2025-02-06 13:22:37,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:37,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:37,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:37,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:37,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:37,215 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:37,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:37,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848582008] [2025-02-06 13:22:37,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848582008] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:37,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596399401] [2025-02-06 13:22:37,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:37,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:37,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:37,218 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:37,220 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:37,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:37,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:37,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:37,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:37,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:22:37,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:37,304 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:37,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:37,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596399401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:37,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:37,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 13:22:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380889255] [2025-02-06 13:22:37,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:37,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:37,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:37,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:37,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:37,305 INFO L87 Difference]: Start difference. First operand 131 states and 162 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:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:37,345 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2025-02-06 13:22:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:37,345 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:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:37,346 INFO L225 Difference]: With dead ends: 139 [2025-02-06 13:22:37,346 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 13:22:37,347 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:37,347 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:37,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 159 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 13:22:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2025-02-06 13:22:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 126 states have internal predecessors, (156), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2025-02-06 13:22:37,353 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 15 [2025-02-06 13:22:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:37,354 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2025-02-06 13:22:37,354 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:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2025-02-06 13:22:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:22:37,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:37,354 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:37,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:22:37,559 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:37,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:37,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:37,563 INFO L85 PathProgramCache]: Analyzing trace with hash -178235203, now seen corresponding path program 1 times [2025-02-06 13:22:37,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:37,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572850386] [2025-02-06 13:22:37,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:37,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:37,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:37,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:37,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:37,701 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:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572850386] [2025-02-06 13:22:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572850386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:37,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:37,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773888683] [2025-02-06 13:22:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:37,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:37,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:37,702 INFO L87 Difference]: Start difference. First operand 133 states and 164 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:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:37,868 INFO L93 Difference]: Finished difference Result 291 states and 359 transitions. [2025-02-06 13:22:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:37,868 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:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:37,873 INFO L225 Difference]: With dead ends: 291 [2025-02-06 13:22:37,873 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 13:22:37,874 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:37,874 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 109 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:37,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 264 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 13:22:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 146. [2025-02-06 13:22:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 139 states have internal predecessors, (171), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2025-02-06 13:22:37,896 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 15 [2025-02-06 13:22:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:37,896 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2025-02-06 13:22:37,896 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:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2025-02-06 13:22:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:22:37,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:37,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:37,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:22:37,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:37,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1230324013, now seen corresponding path program 1 times [2025-02-06 13:22:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:37,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834832980] [2025-02-06 13:22:37,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:37,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:37,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:22:37,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:22:37,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:37,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:38,021 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:38,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834832980] [2025-02-06 13:22:38,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834832980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:38,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:38,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:38,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956882024] [2025-02-06 13:22:38,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:38,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:38,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:38,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:38,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:38,027 INFO L87 Difference]: Start difference. First operand 146 states and 179 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, (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:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:38,182 INFO L93 Difference]: Finished difference Result 155 states and 183 transitions. [2025-02-06 13:22:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:38,186 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, (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 16 [2025-02-06 13:22:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:38,187 INFO L225 Difference]: With dead ends: 155 [2025-02-06 13:22:38,187 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 13:22:38,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:22:38,188 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 73 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:38,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 328 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 13:22:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2025-02-06 13:22:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 139 states have internal predecessors, (168), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2025-02-06 13:22:38,205 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 16 [2025-02-06 13:22:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:38,205 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2025-02-06 13:22:38,205 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, (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:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2025-02-06 13:22:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:22:38,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:38,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:38,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:22:38,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:38,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1129994242, now seen corresponding path program 1 times [2025-02-06 13:22:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:38,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137936814] [2025-02-06 13:22:38,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:38,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:22:38,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:22:38,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:38,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:22:38,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:38,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137936814] [2025-02-06 13:22:38,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137936814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:38,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:38,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:22:38,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785939783] [2025-02-06 13:22:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:38,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:38,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:38,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:38,257 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:38,299 INFO L93 Difference]: Finished difference Result 146 states and 176 transitions. [2025-02-06 13:22:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:38,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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 16 [2025-02-06 13:22:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:38,301 INFO L225 Difference]: With dead ends: 146 [2025-02-06 13:22:38,301 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 13:22:38,302 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:38,302 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:38,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 174 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 13:22:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2025-02-06 13:22:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 136 states have internal predecessors, (164), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 172 transitions. [2025-02-06 13:22:38,317 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 172 transitions. Word has length 16 [2025-02-06 13:22:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:38,317 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 172 transitions. [2025-02-06 13:22:38,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) 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:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2025-02-06 13:22:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 13:22:38,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:38,318 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:38,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:22:38,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:38,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2074747960, now seen corresponding path program 1 times [2025-02-06 13:22:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903808950] [2025-02-06 13:22:38,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:38,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:38,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:22:38,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:22:38,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:38,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:38,352 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:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903808950] [2025-02-06 13:22:38,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903808950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:38,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:38,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:38,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255505387] [2025-02-06 13:22:38,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:38,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:38,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:38,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:38,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:38,354 INFO L87 Difference]: Start difference. First operand 143 states and 172 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:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:38,398 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2025-02-06 13:22:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:38,399 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:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:38,400 INFO L225 Difference]: With dead ends: 143 [2025-02-06 13:22:38,401 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 13:22:38,401 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:38,401 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:38,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 165 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 13:22:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2025-02-06 13:22:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 125 states have internal predecessors, (149), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2025-02-06 13:22:38,412 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 20 [2025-02-06 13:22:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:38,412 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2025-02-06 13:22:38,412 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:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2025-02-06 13:22:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:22:38,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:38,413 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:38,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:22:38,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:38,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1776189540, now seen corresponding path program 1 times [2025-02-06 13:22:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120247651] [2025-02-06 13:22:38,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:38,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:38,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:38,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:38,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:38,452 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:38,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:38,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120247651] [2025-02-06 13:22:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120247651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:38,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997004272] [2025-02-06 13:22:38,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:38,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:38,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:38,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:38,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:38,454 INFO L87 Difference]: Start difference. First operand 132 states and 157 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:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:38,534 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2025-02-06 13:22:38,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:38,535 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:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:38,536 INFO L225 Difference]: With dead ends: 178 [2025-02-06 13:22:38,537 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 13:22:38,538 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:38,538 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 121 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:38,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 262 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 13:22:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 161. [2025-02-06 13:22:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3453237410071943) internal successors, (187), 153 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2025-02-06 13:22:38,547 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 24 [2025-02-06 13:22:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:38,548 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2025-02-06 13:22:38,548 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:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2025-02-06 13:22:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:22:38,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:38,550 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:38,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:22:38,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:38,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1774897542, now seen corresponding path program 1 times [2025-02-06 13:22:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:38,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388181106] [2025-02-06 13:22:38,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:38,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:38,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:38,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:38,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:38,603 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:38,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:38,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388181106] [2025-02-06 13:22:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388181106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:38,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:38,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:38,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383664598] [2025-02-06 13:22:38,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:38,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:38,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:38,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:38,605 INFO L87 Difference]: Start difference. First operand 161 states and 195 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:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:38,685 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2025-02-06 13:22:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:38,685 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:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:38,686 INFO L225 Difference]: With dead ends: 171 [2025-02-06 13:22:38,688 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 13:22:38,688 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:38,688 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 111 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:38,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 265 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 13:22:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2025-02-06 13:22:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 153 states have internal predecessors, (186), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2025-02-06 13:22:38,696 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 24 [2025-02-06 13:22:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:38,697 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2025-02-06 13:22:38,697 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:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2025-02-06 13:22:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:22:38,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:38,698 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:38,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:22:38,698 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:38,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash -273068779, now seen corresponding path program 1 times [2025-02-06 13:22:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:38,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394110857] [2025-02-06 13:22:38,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:38,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:38,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:22:38,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:22:38,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:38,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:22:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394110857] [2025-02-06 13:22:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394110857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:38,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733892525] [2025-02-06 13:22:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:38,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:38,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:38,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:38,757 INFO L87 Difference]: Start difference. First operand 161 states and 194 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:38,873 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2025-02-06 13:22:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:38,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-02-06 13:22:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:38,874 INFO L225 Difference]: With dead ends: 171 [2025-02-06 13:22:38,874 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 13:22:38,874 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:38,875 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 120 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 258 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:38,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 258 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:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 13:22:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2025-02-06 13:22:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 135 states have (on average 1.325925925925926) internal successors, (179), 147 states have internal predecessors, (179), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 187 transitions. [2025-02-06 13:22:38,885 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 187 transitions. Word has length 31 [2025-02-06 13:22:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:38,885 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 187 transitions. [2025-02-06 13:22:38,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 187 transitions. [2025-02-06 13:22:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:22:38,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:38,887 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:38,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:22:38,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:38,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash -271776781, now seen corresponding path program 1 times [2025-02-06 13:22:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:38,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374831074] [2025-02-06 13:22:38,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:38,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:22:38,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:22:38,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:38,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:22:38,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:38,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374831074] [2025-02-06 13:22:38,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374831074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:38,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:38,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:38,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481883439] [2025-02-06 13:22:38,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:38,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:38,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:38,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:38,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:38,937 INFO L87 Difference]: Start difference. First operand 155 states and 187 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:39,014 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2025-02-06 13:22:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:39,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-02-06 13:22:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:39,015 INFO L225 Difference]: With dead ends: 164 [2025-02-06 13:22:39,017 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 13:22:39,017 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:39,017 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 110 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:39,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 259 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 13:22:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2025-02-06 13:22:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 146 states have internal predecessors, (178), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 186 transitions. [2025-02-06 13:22:39,026 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 186 transitions. Word has length 31 [2025-02-06 13:22:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:39,026 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 186 transitions. [2025-02-06 13:22:39,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 186 transitions. [2025-02-06 13:22:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 13:22:39,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:39,026 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1] [2025-02-06 13:22:39,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:22:39,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:39,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1199265641, now seen corresponding path program 1 times [2025-02-06 13:22:39,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:39,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544696013] [2025-02-06 13:22:39,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:39,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:39,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:22:39,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:22:39,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:39,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:39,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:39,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544696013] [2025-02-06 13:22:39,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544696013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:39,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:39,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:39,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425048600] [2025-02-06 13:22:39,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:39,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:39,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:39,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:39,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:39,107 INFO L87 Difference]: Start difference. First operand 154 states and 186 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:39,176 INFO L93 Difference]: Finished difference Result 333 states and 399 transitions. [2025-02-06 13:22:39,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:39,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-02-06 13:22:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:39,178 INFO L225 Difference]: With dead ends: 333 [2025-02-06 13:22:39,178 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 13:22:39,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:39,178 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 62 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:39,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 246 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 13:22:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 185. [2025-02-06 13:22:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.309090909090909) internal successors, (216), 176 states have internal predecessors, (216), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 224 transitions. [2025-02-06 13:22:39,187 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 224 transitions. Word has length 33 [2025-02-06 13:22:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:39,187 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 224 transitions. [2025-02-06 13:22:39,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 224 transitions. [2025-02-06 13:22:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 13:22:39,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:39,188 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-02-06 13:22:39,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:22:39,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:39,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1870062177, now seen corresponding path program 1 times [2025-02-06 13:22:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120679960] [2025-02-06 13:22:39,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:39,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 13:22:39,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:22:39,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:39,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120679960] [2025-02-06 13:22:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120679960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832068125] [2025-02-06 13:22:39,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:39,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:39,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:39,296 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:39,305 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:39,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 13:22:39,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:22:39,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:39,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:22:39,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:39,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:39,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832068125] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:39,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:39,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-06 13:22:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479550996] [2025-02-06 13:22:39,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:39,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:22:39,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:39,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:22:39,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:22:39,502 INFO L87 Difference]: Start difference. First operand 185 states and 224 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:39,737 INFO L93 Difference]: Finished difference Result 724 states and 903 transitions. [2025-02-06 13:22:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:22:39,737 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2025-02-06 13:22:39,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:39,739 INFO L225 Difference]: With dead ends: 724 [2025-02-06 13:22:39,739 INFO L226 Difference]: Without dead ends: 558 [2025-02-06 13:22:39,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-02-06 13:22:39,740 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 102 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:39,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 709 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:22:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-02-06 13:22:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 225. [2025-02-06 13:22:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 205 states have (on average 1.2878048780487805) internal successors, (264), 216 states have internal predecessors, (264), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 272 transitions. [2025-02-06 13:22:39,754 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 272 transitions. Word has length 46 [2025-02-06 13:22:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:39,755 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 272 transitions. [2025-02-06 13:22:39,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 272 transitions. [2025-02-06 13:22:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 13:22:39,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:39,756 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:39,765 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:39,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:39,957 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:39,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2137225076, now seen corresponding path program 1 times [2025-02-06 13:22:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:39,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345153405] [2025-02-06 13:22:39,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:39,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 13:22:39,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 13:22:39,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:39,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:22:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:40,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345153405] [2025-02-06 13:22:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345153405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:40,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:40,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113447769] [2025-02-06 13:22:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:40,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:40,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:40,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:40,019 INFO L87 Difference]: Start difference. First operand 225 states and 272 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:40,082 INFO L93 Difference]: Finished difference Result 435 states and 524 transitions. [2025-02-06 13:22:40,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:40,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2025-02-06 13:22:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:40,083 INFO L225 Difference]: With dead ends: 435 [2025-02-06 13:22:40,083 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 13:22:40,084 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:40,084 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 14 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:40,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 272 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 13:22:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 225. [2025-02-06 13:22:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 205 states have (on average 1.2682926829268293) internal successors, (260), 216 states have internal predecessors, (260), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 268 transitions. [2025-02-06 13:22:40,096 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 268 transitions. Word has length 49 [2025-02-06 13:22:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:40,096 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 268 transitions. [2025-02-06 13:22:40,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 268 transitions. [2025-02-06 13:22:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 13:22:40,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:40,097 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:40,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:22:40,097 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:40,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:40,097 INFO L85 PathProgramCache]: Analyzing trace with hash 848250532, now seen corresponding path program 1 times [2025-02-06 13:22:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:40,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679356863] [2025-02-06 13:22:40,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:40,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 13:22:40,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 13:22:40,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:40,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:40,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:40,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679356863] [2025-02-06 13:22:40,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679356863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:40,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:40,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:22:40,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496681424] [2025-02-06 13:22:40,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:40,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:40,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:40,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:40,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:40,187 INFO L87 Difference]: Start difference. First operand 225 states and 268 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:40,278 INFO L93 Difference]: Finished difference Result 432 states and 510 transitions. [2025-02-06 13:22:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2025-02-06 13:22:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:40,280 INFO L225 Difference]: With dead ends: 432 [2025-02-06 13:22:40,280 INFO L226 Difference]: Without dead ends: 306 [2025-02-06 13:22:40,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:40,281 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 74 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:40,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 184 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-06 13:22:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 225. [2025-02-06 13:22:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 205 states have (on average 1.2634146341463415) internal successors, (259), 216 states have internal predecessors, (259), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2025-02-06 13:22:40,294 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 51 [2025-02-06 13:22:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:40,294 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2025-02-06 13:22:40,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2025-02-06 13:22:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 13:22:40,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:40,295 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:40,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:22:40,295 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:40,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1062597175, now seen corresponding path program 1 times [2025-02-06 13:22:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:40,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155735094] [2025-02-06 13:22:40,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:40,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 13:22:40,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 13:22:40,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:40,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:40,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155735094] [2025-02-06 13:22:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155735094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:40,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453776392] [2025-02-06 13:22:40,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:40,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:40,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:40,454 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:40,459 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:40,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 13:22:40,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 13:22:40,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:40,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:40,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 13:22:40,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:40,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453776392] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:41,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 21 [2025-02-06 13:22:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721116863] [2025-02-06 13:22:41,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:41,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 13:22:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:41,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 13:22:41,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:22:41,053 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:41,772 INFO L93 Difference]: Finished difference Result 644 states and 754 transitions. [2025-02-06 13:22:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 13:22:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2025-02-06 13:22:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:41,774 INFO L225 Difference]: With dead ends: 644 [2025-02-06 13:22:41,774 INFO L226 Difference]: Without dead ends: 420 [2025-02-06 13:22:41,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=302, Invalid=568, Unknown=0, NotChecked=0, Total=870 [2025-02-06 13:22:41,775 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 197 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:41,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 901 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 13:22:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-06 13:22:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 225. [2025-02-06 13:22:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 205 states have (on average 1.2390243902439024) internal successors, (254), 216 states have internal predecessors, (254), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2025-02-06 13:22:41,791 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 56 [2025-02-06 13:22:41,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:41,791 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2025-02-06 13:22:41,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2025-02-06 13:22:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 13:22:41,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:41,792 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 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] [2025-02-06 13:22:41,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:22:41,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:41,992 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:41,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 339649709, now seen corresponding path program 1 times [2025-02-06 13:22:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686843590] [2025-02-06 13:22:41,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:41,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 13:22:42,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 13:22:42,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:42,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 41 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:42,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686843590] [2025-02-06 13:22:42,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686843590] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:42,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479131666] [2025-02-06 13:22:42,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:42,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:42,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:42,169 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:42,170 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:42,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 13:22:42,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 13:22:42,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:42,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:42,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:22:42,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 41 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:42,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 41 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:42,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479131666] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:42,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:42,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-02-06 13:22:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127727982] [2025-02-06 13:22:42,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:42,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 13:22:42,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:42,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 13:22:42,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2025-02-06 13:22:42,517 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand has 26 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:42,827 INFO L93 Difference]: Finished difference Result 1216 states and 1485 transitions. [2025-02-06 13:22:42,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 13:22:42,828 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 67 [2025-02-06 13:22:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:42,830 INFO L225 Difference]: With dead ends: 1216 [2025-02-06 13:22:42,831 INFO L226 Difference]: Without dead ends: 1030 [2025-02-06 13:22:42,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=449, Unknown=0, NotChecked=0, Total=702 [2025-02-06 13:22:42,832 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 771 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:42,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 475 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:22:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-02-06 13:22:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 305. [2025-02-06 13:22:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 285 states have (on average 1.2280701754385965) internal successors, (350), 296 states have internal predecessors, (350), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 358 transitions. [2025-02-06 13:22:42,849 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 358 transitions. Word has length 67 [2025-02-06 13:22:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:42,849 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 358 transitions. [2025-02-06 13:22:42,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 358 transitions. [2025-02-06 13:22:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 13:22:42,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:42,850 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:42,860 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:43,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 13:22:43,054 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:43,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash -270361993, now seen corresponding path program 2 times [2025-02-06 13:22:43,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:43,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746744225] [2025-02-06 13:22:43,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:22:43,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:43,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-06 13:22:43,087 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:43,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:22:43,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:43,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746744225] [2025-02-06 13:22:43,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746744225] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:43,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083465513] [2025-02-06 13:22:43,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:22:43,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:43,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:43,417 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:43,422 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:43,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-06 13:22:43,524 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:43,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:22:43,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:43,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 13:22:43,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:44,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:45,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083465513] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:45,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 16] total 38 [2025-02-06 13:22:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228797917] [2025-02-06 13:22:45,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:45,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 13:22:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:45,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 13:22:45,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=974, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 13:22:45,918 INFO L87 Difference]: Start difference. First operand 305 states and 358 transitions. Second operand has 38 states, 38 states have (on average 3.9473684210526314) internal successors, (150), 38 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,098 INFO L93 Difference]: Finished difference Result 910 states and 1067 transitions. [2025-02-06 13:22:53,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 13:22:53,099 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.9473684210526314) internal successors, (150), 38 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2025-02-06 13:22:53,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:53,103 INFO L225 Difference]: With dead ends: 910 [2025-02-06 13:22:53,103 INFO L226 Difference]: Without dead ends: 648 [2025-02-06 13:22:53,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1124, Invalid=2416, Unknown=0, NotChecked=0, Total=3540 [2025-02-06 13:22:53,107 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 373 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:53,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1994 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-06 13:22:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-02-06 13:22:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 305. [2025-02-06 13:22:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 285 states have (on average 1.1964912280701754) internal successors, (341), 296 states have internal predecessors, (341), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 349 transitions. [2025-02-06 13:22:53,126 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 349 transitions. Word has length 76 [2025-02-06 13:22:53,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:53,126 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 349 transitions. [2025-02-06 13:22:53,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.9473684210526314) internal successors, (150), 38 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 349 transitions. [2025-02-06 13:22:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 13:22:53,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:53,129 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 14, 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] [2025-02-06 13:22:53,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 13:22:53,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:53,330 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:53,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:53,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1225827373, now seen corresponding path program 2 times [2025-02-06 13:22:53,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:53,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3736672] [2025-02-06 13:22:53,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:22:53,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:53,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-02-06 13:22:53,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 13:22:53,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:22:53,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 81 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:53,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3736672] [2025-02-06 13:22:53,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3736672] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566665460] [2025-02-06 13:22:53,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:22:53,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:53,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:53,668 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:53,669 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:53,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-02-06 13:22:53,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 13:22:53,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:22:53,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:22:53,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 81 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:53,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 81 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566665460] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:54,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2025-02-06 13:22:54,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951903091] [2025-02-06 13:22:54,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:54,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 13:22:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:54,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 13:22:54,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 13:22:54,537 INFO L87 Difference]: Start difference. First operand 305 states and 349 transitions. Second operand has 50 states, 50 states have (on average 5.12) internal successors, (256), 50 states have internal predecessors, (256), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:55,208 INFO L93 Difference]: Finished difference Result 2236 states and 2750 transitions. [2025-02-06 13:22:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 13:22:55,209 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.12) internal successors, (256), 50 states have internal predecessors, (256), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2025-02-06 13:22:55,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:55,215 INFO L225 Difference]: With dead ends: 2236 [2025-02-06 13:22:55,215 INFO L226 Difference]: Without dead ends: 2010 [2025-02-06 13:22:55,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=893, Invalid=1657, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 13:22:55,217 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1391 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:55,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 727 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:22:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2025-02-06 13:22:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 465. [2025-02-06 13:22:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 445 states have (on average 1.1977528089887641) internal successors, (533), 456 states have internal predecessors, (533), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 541 transitions. [2025-02-06 13:22:55,246 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 541 transitions. Word has length 107 [2025-02-06 13:22:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:55,246 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 541 transitions. [2025-02-06 13:22:55,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.12) internal successors, (256), 50 states have internal predecessors, (256), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 541 transitions. [2025-02-06 13:22:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 13:22:55,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:55,247 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:55,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 13:22:55,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:55,448 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:55,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash -493352201, now seen corresponding path program 3 times [2025-02-06 13:22:55,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:55,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777493426] [2025-02-06 13:22:55,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:22:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:55,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 15 equivalence classes. [2025-02-06 13:22:55,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 13:22:55,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-02-06 13:22:55,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 88 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:56,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:56,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777493426] [2025-02-06 13:22:56,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777493426] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:56,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209429481] [2025-02-06 13:22:56,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:22:56,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:56,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:56,086 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,087 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,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 15 equivalence classes. [2025-02-06 13:22:56,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 13:22:56,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-02-06 13:22:56,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:56,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 13:22:56,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 88 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:57,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:23:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 88 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:23:00,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209429481] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:23:00,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:23:00,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24, 24] total 61 [2025-02-06 13:23:00,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458380214] [2025-02-06 13:23:00,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:23:00,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-02-06 13:23:00,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:00,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-02-06 13:23:00,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1143, Invalid=2517, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 13:23:00,317 INFO L87 Difference]: Start difference. First operand 465 states and 541 transitions. Second operand has 61 states, 61 states have (on average 4.459016393442623) internal successors, (272), 61 states have internal predecessors, (272), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:24:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:24:09,870 INFO L93 Difference]: Finished difference Result 1490 states and 1742 transitions. [2025-02-06 13:24:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-06 13:24:09,870 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.459016393442623) internal successors, (272), 61 states have internal predecessors, (272), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116 [2025-02-06 13:24:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:24:09,874 INFO L225 Difference]: With dead ends: 1490 [2025-02-06 13:24:09,874 INFO L226 Difference]: Without dead ends: 1146 [2025-02-06 13:24:09,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3763 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=3092, Invalid=6414, Unknown=0, NotChecked=0, Total=9506 [2025-02-06 13:24:09,876 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 1156 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 3600 SdHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:24:09,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 3600 Invalid, 3361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 26.1s Time] [2025-02-06 13:24:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-02-06 13:24:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 465. [2025-02-06 13:24:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 445 states have (on average 1.1617977528089887) internal successors, (517), 456 states have internal predecessors, (517), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:24:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 525 transitions. [2025-02-06 13:24:09,915 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 525 transitions. Word has length 116 [2025-02-06 13:24:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:24:09,915 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 525 transitions. [2025-02-06 13:24:09,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.459016393442623) internal successors, (272), 61 states have internal predecessors, (272), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:24:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 525 transitions. [2025-02-06 13:24:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-06 13:24:09,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:24:09,917 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 23, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:24:09,928 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:24:10,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:24:10,118 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:24:10,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:24:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -924019817, now seen corresponding path program 4 times [2025-02-06 13:24:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:24:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17865216] [2025-02-06 13:24:10,119 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 13:24:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:24:10,125 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 166 statements into 2 equivalence classes. [2025-02-06 13:24:10,181 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 13:24:10,182 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 13:24:10,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:24:10,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:24:10,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 13:24:10,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 13:24:10,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:24:10,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:24:10,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:24:10,263 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:24:10,263 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-02-06 13:24:10,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-02-06 13:24:10,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-02-06 13:24:10,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-02-06 13:24:10,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-02-06 13:24:10,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-02-06 13:24:10,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-02-06 13:24:10,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-02-06 13:24:10,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-02-06 13:24:10,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-02-06 13:24:10,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-02-06 13:24:10,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 13:24:10,269 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:24:10,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:24:10,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:24:10 BoogieIcfgContainer [2025-02-06 13:24:10,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:24:10,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:24:10,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:24:10,324 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:24:10,325 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:36" (3/4) ... [2025-02-06 13:24:10,326 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 13:24:10,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:24:10,327 INFO L158 Benchmark]: Toolchain (without parser) took 94678.94ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 107.4MB in the beginning and 218.7MB in the end (delta: -111.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2025-02-06 13:24:10,327 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:24:10,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.70ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 94.0MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:24:10,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.93ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:24:10,328 INFO L158 Benchmark]: Boogie Preprocessor took 22.22ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:24:10,328 INFO L158 Benchmark]: IcfgBuilder took 376.41ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 64.4MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 13:24:10,328 INFO L158 Benchmark]: TraceAbstraction took 93994.84ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 63.7MB in the beginning and 218.8MB in the end (delta: -155.2MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. [2025-02-06 13:24:10,329 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 268.4MB. Free memory was 218.8MB in the beginning and 218.7MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:24:10,330 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.27ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.70ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 94.0MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.93ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.22ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 376.41ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 64.4MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 93994.84ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 63.7MB in the beginning and 218.8MB in the end (delta: -155.2MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 268.4MB. Free memory was 218.8MB in the beginning and 218.7MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=1, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L238] RET, EXPR base2flt(0, 0) VAL [ea=1, eb=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24] [L76] m = m & ~ (1U << 24U) [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR (e + 128) << 24U VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR m | (unsigned int )((e + 128) << 24U) VAL [\old(e)=0, \old(m)=1] [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [ea=1, eb=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=1, \old(m)=8388608] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=1, \old(m)=8388608, e=1, m=8388608] [L29] COND FALSE !(! m) VAL [\old(e)=1, \old(m)=8388608, e=1, m=8388608] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=1, \old(m)=8388608, e=1, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=1, \old(m)=8388608, e=1, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=1, \old(m)=8388608, e=1, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=1, \old(m)=8388608, e=0, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=1, \old(m)=8388608, e=0, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=1, \old(m)=8388608, e=0] [L76] m = m & ~ (1U << 24U) [L77] EXPR e + 128 VAL [\old(e)=1, \old(m)=8388608, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=1, \old(m)=8388608, m=0] - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 123 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 93.9s, OverallIterations: 22, TraceHistogramMax: 25, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 80.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4904 SdHoareTripleChecker+Valid, 33.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4894 mSDsluCounter, 11992 SdHoareTripleChecker+Invalid, 32.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9949 mSDsCounter, 425 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7235 IncrementalHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 425 mSolverCounterUnsat, 2043 mSDtfsCounter, 7235 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1190 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6607 ImplicationChecksByTransitivity, 51.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=20, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 4071 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1747 ConstructedInterpolants, 0 QuantifiedInterpolants, 10608 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1095 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 34 InterpolantComputations, 15 PerfectInterpolantSequences, 1072/4418 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 13:24:10,544 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-02-06 13:24:10,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_3.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:24:12,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:24:12,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2025-02-06 13:24:12,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:24:12,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:24:12,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:24:12,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:24:12,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:24:12,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:24:12,505 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:24:12,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:24:12,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:24:12,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:24:12,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:24:12,506 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:24:12,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:24:12,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:24:12,506 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:24:12,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:24:12,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:24:12,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:24:12,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:24:12,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:24:12,507 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:24:12,507 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 13:24:12,507 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:24:12,507 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 13:24:12,507 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:24:12,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:24:12,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:24:12,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:24:12,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:24:12,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:24:12,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:24:12,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:24:12,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:24:12,509 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 -> aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 [2025-02-06 13:24:12,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:24:12,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:24:12,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:24:12,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:24:12,802 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:24:12,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2025-02-06 13:24:13,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a259a440/29459dd622874b78945fb377e63bc365/FLAGf6f169bcf