./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-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_1-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 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:22:30,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:22:30,098 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:30,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:22:30,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:22:30,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:22:30,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:22:30,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:22:30,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:22:30,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:22:30,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:22:30,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:22:30,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:22:30,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:30,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:22:30,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:22:30,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:22:30,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:22:30,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:22:30,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:22:30,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:22:30,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:22:30,124 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 -> 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 [2025-02-06 13:22:30,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:22:30,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:22:30,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:22:30,357 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:22:30,357 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:22:30,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2025-02-06 13:22:31,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fa6d7588/ec293e48f8304b1fb51f7093dfb99995/FLAG52f570d4a [2025-02-06 13:22:31,811 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:22:31,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2025-02-06 13:22:31,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fa6d7588/ec293e48f8304b1fb51f7093dfb99995/FLAG52f570d4a [2025-02-06 13:22:32,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2fa6d7588/ec293e48f8304b1fb51f7093dfb99995 [2025-02-06 13:22:32,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:22:32,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:22:32,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:32,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:22:32,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:22:32,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:32" (1/1) ... [2025-02-06 13:22:32,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67682a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:32, skipping insertion in model container [2025-02-06 13:22:32,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:32" (1/1) ... [2025-02-06 13:22:32,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:22:32,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:32,308 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:22:32,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:32,347 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:22:32,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:32 WrapperNode [2025-02-06 13:22:32,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:32,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:32,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:22:32,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:22:32,353 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:32" (1/1) ... [2025-02-06 13:22:32,360 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:32" (1/1) ... [2025-02-06 13:22:32,386 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 209 [2025-02-06 13:22:32,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:32,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:22:32,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:22:32,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:22:32,393 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:32" (1/1) ... [2025-02-06 13:22:32,393 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:32" (1/1) ... [2025-02-06 13:22:32,395 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:32" (1/1) ... [2025-02-06 13:22:32,405 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:32,405 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:32" (1/1) ... [2025-02-06 13:22:32,405 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:32" (1/1) ... [2025-02-06 13:22:32,408 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:32" (1/1) ... [2025-02-06 13:22:32,409 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:32" (1/1) ... [2025-02-06 13:22:32,410 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:32" (1/1) ... [2025-02-06 13:22:32,410 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:32" (1/1) ... [2025-02-06 13:22:32,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:22:32,413 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:22:32,413 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:22:32,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:22:32,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:32" (1/1) ... [2025-02-06 13:22:32,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:32,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:32,441 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:32,444 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:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:22:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:22:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-06 13:22:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-06 13:22:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:22:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:22:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 13:22:32,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 13:22:32,507 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:22:32,508 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:22:32,824 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-02-06 13:22:32,825 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:22:32,845 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:22:32,845 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 13:22:32,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:32 BoogieIcfgContainer [2025-02-06 13:22:32,846 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:22:32,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:22:32,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:22:32,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:22:32,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:22:32" (1/3) ... [2025-02-06 13:22:32,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2f69a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:32, skipping insertion in model container [2025-02-06 13:22:32,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:32" (2/3) ... [2025-02-06 13:22:32,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2f69a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:32, skipping insertion in model container [2025-02-06 13:22:32,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:32" (3/3) ... [2025-02-06 13:22:32,852 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2025-02-06 13:22:32,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:22:32,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-3.c.cil.c that has 3 procedures, 140 locations, 1 initial locations, 2 loop locations, and 22 error locations. [2025-02-06 13:22:32,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:22:32,922 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;@11f8f688, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:22:32,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-06 13:22:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 105 states have (on average 1.638095238095238) internal successors, (172), 130 states have internal predecessors, (172), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 13:22:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:22:32,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:32,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:32,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:32,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1026166153, now seen corresponding path program 1 times [2025-02-06 13:22:32,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:32,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256924901] [2025-02-06 13:22:32,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:32,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:32,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:22:33,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:22:33,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:33,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:33,125 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:33,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:33,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256924901] [2025-02-06 13:22:33,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256924901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:33,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332749921] [2025-02-06 13:22:33,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:33,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:33,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:33,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:33,150 INFO L87 Difference]: Start difference. First operand has 140 states, 105 states have (on average 1.638095238095238) internal successors, (172), 130 states have internal predecessors, (172), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:33,280 INFO L93 Difference]: Finished difference Result 324 states and 454 transitions. [2025-02-06 13:22:33,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:33,282 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:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:33,290 INFO L225 Difference]: With dead ends: 324 [2025-02-06 13:22:33,290 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 13:22:33,295 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:33,300 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 69 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:33,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 480 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 13:22:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2025-02-06 13:22:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 130 states have internal predecessors, (168), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 180 transitions. [2025-02-06 13:22:33,351 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 180 transitions. Word has length 9 [2025-02-06 13:22:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:33,352 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 180 transitions. [2025-02-06 13:22:33,352 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:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 180 transitions. [2025-02-06 13:22:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:22:33,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:33,353 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:33,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:22:33,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:33,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:33,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2051009830, now seen corresponding path program 1 times [2025-02-06 13:22:33,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:33,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9906629] [2025-02-06 13:22:33,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:33,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:33,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:22:33,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:22:33,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:33,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:33,392 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:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:33,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9906629] [2025-02-06 13:22:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9906629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:22:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584903685] [2025-02-06 13:22:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:33,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:33,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:33,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:33,394 INFO L87 Difference]: Start difference. First operand 140 states and 180 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:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:33,448 INFO L93 Difference]: Finished difference Result 140 states and 180 transitions. [2025-02-06 13:22:33,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:33,449 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:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:33,450 INFO L225 Difference]: With dead ends: 140 [2025-02-06 13:22:33,450 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 13:22:33,450 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:33,451 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:33,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 13:22:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-06 13:22:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.4690265486725664) internal successors, (166), 129 states have internal predecessors, (166), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2025-02-06 13:22:33,459 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 14 [2025-02-06 13:22:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:33,459 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2025-02-06 13:22:33,459 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:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2025-02-06 13:22:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:22:33,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:33,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:33,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:22:33,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:33,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2050995925, now seen corresponding path program 1 times [2025-02-06 13:22:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815376459] [2025-02-06 13:22:33,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:33,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:22:33,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:22:33,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:33,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:33,519 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:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815376459] [2025-02-06 13:22:33,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815376459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:33,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130098935] [2025-02-06 13:22:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:33,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:33,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:33,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:33,522 INFO L87 Difference]: Start difference. First operand 139 states and 178 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:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:33,570 INFO L93 Difference]: Finished difference Result 258 states and 329 transitions. [2025-02-06 13:22:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:33,572 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:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:33,573 INFO L225 Difference]: With dead ends: 258 [2025-02-06 13:22:33,573 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 13:22:33,574 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:33,574 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:33,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 215 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 13:22:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2025-02-06 13:22:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 129 states have internal predecessors, (164), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 176 transitions. [2025-02-06 13:22:33,584 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 176 transitions. Word has length 14 [2025-02-06 13:22:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:33,584 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 176 transitions. [2025-02-06 13:22:33,584 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:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 176 transitions. [2025-02-06 13:22:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:22:33,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:33,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:33,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:22:33,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:33,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash 843204708, now seen corresponding path program 1 times [2025-02-06 13:22:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262260733] [2025-02-06 13:22:33,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:33,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:33,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:33,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:33,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:33,659 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:33,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:33,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262260733] [2025-02-06 13:22:33,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262260733] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:33,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662168408] [2025-02-06 13:22:33,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:33,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:33,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:33,662 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:33,663 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:33,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:33,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:33,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:33,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:33,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:22:33,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:33,745 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:33,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662168408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 13:22:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139744140] [2025-02-06 13:22:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:33,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:33,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:33,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:33,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:33,748 INFO L87 Difference]: Start difference. First operand 139 states and 176 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:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:33,801 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2025-02-06 13:22:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:33,802 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:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:33,803 INFO L225 Difference]: With dead ends: 147 [2025-02-06 13:22:33,803 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 13:22:33,803 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:33,804 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:33,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 185 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:33,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 13:22:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2025-02-06 13:22:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 115 states have (on average 1.4434782608695653) internal successors, (166), 131 states have internal predecessors, (166), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2025-02-06 13:22:33,814 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 15 [2025-02-06 13:22:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:33,814 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2025-02-06 13:22:33,814 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:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2025-02-06 13:22:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:22:33,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:33,815 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:33,822 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:34,017 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:34,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:34,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash 843786690, now seen corresponding path program 1 times [2025-02-06 13:22:34,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:34,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71254957] [2025-02-06 13:22:34,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:34,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:34,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:34,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:34,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:34,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:34,111 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:34,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:34,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71254957] [2025-02-06 13:22:34,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71254957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:34,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:34,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:34,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173633355] [2025-02-06 13:22:34,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:34,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:34,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:34,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:34,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:34,114 INFO L87 Difference]: Start difference. First operand 141 states and 178 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:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:34,228 INFO L93 Difference]: Finished difference Result 274 states and 337 transitions. [2025-02-06 13:22:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:34,229 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:34,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:34,229 INFO L225 Difference]: With dead ends: 274 [2025-02-06 13:22:34,230 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 13:22:34,230 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:34,232 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 109 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:34,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 311 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 13:22:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2025-02-06 13:22:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.4140625) internal successors, (181), 144 states have internal predecessors, (181), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 193 transitions. [2025-02-06 13:22:34,246 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 193 transitions. Word has length 15 [2025-02-06 13:22:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:34,246 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 193 transitions. [2025-02-06 13:22:34,246 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:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 193 transitions. [2025-02-06 13:22:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:22:34,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:34,247 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:34,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:22:34,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:34,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash -808449077, now seen corresponding path program 1 times [2025-02-06 13:22:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:34,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596153582] [2025-02-06 13:22:34,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:34,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:34,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:22:34,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:22:34,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:34,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:34,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596153582] [2025-02-06 13:22:34,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596153582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:34,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:34,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725636263] [2025-02-06 13:22:34,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:34,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:34,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:34,295 INFO L87 Difference]: Start difference. First operand 154 states and 193 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:34,436 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2025-02-06 13:22:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:34,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-06 13:22:34,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:34,440 INFO L225 Difference]: With dead ends: 203 [2025-02-06 13:22:34,440 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 13:22:34,440 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:34,440 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 132 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:34,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 313 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 13:22:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2025-02-06 13:22:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 154 states have (on average 1.4025974025974026) internal successors, (216), 169 states have internal predecessors, (216), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 228 transitions. [2025-02-06 13:22:34,476 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 228 transitions. Word has length 17 [2025-02-06 13:22:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:34,476 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 228 transitions. [2025-02-06 13:22:34,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 228 transitions. [2025-02-06 13:22:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:22:34,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:34,477 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:34,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:22:34,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:34,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash -807157079, now seen corresponding path program 1 times [2025-02-06 13:22:34,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:34,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381450872] [2025-02-06 13:22:34,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:34,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:22:34,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:22:34,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:34,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:34,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381450872] [2025-02-06 13:22:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381450872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:34,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:34,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:34,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262569020] [2025-02-06 13:22:34,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:34,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:34,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:34,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:34,529 INFO L87 Difference]: Start difference. First operand 180 states and 228 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:34,618 INFO L93 Difference]: Finished difference Result 192 states and 237 transitions. [2025-02-06 13:22:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:34,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-06 13:22:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:34,620 INFO L225 Difference]: With dead ends: 192 [2025-02-06 13:22:34,620 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 13:22:34,620 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:34,620 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 122 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:34,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 317 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 13:22:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2025-02-06 13:22:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 153 states have (on average 1.3790849673202614) internal successors, (211), 167 states have internal predecessors, (211), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions. [2025-02-06 13:22:34,630 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 17 [2025-02-06 13:22:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:34,630 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 223 transitions. [2025-02-06 13:22:34,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions. [2025-02-06 13:22:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 13:22:34,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:34,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:34,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:22:34,632 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:34,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:34,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1630858430, now seen corresponding path program 1 times [2025-02-06 13:22:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288812706] [2025-02-06 13:22:34,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:34,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:34,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:22:34,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:22:34,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:34,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:34,684 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:34,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:34,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288812706] [2025-02-06 13:22:34,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288812706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280359245] [2025-02-06 13:22:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:34,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:34,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:34,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:34,686 INFO L87 Difference]: Start difference. First operand 178 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.5) 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:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:34,771 INFO L93 Difference]: Finished difference Result 186 states and 228 transitions. [2025-02-06 13:22:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:34,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) 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 19 [2025-02-06 13:22:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:34,772 INFO L225 Difference]: With dead ends: 186 [2025-02-06 13:22:34,772 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 13:22:34,772 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:34,773 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 68 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:34,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 385 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 13:22:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 178. [2025-02-06 13:22:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 153 states have (on average 1.3725490196078431) internal successors, (210), 167 states have internal predecessors, (210), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 222 transitions. [2025-02-06 13:22:34,779 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 222 transitions. Word has length 19 [2025-02-06 13:22:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:34,779 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 222 transitions. [2025-02-06 13:22:34,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) 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:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 222 transitions. [2025-02-06 13:22:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 13:22:34,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:34,780 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:34,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:22:34,780 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:34,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1851928147, now seen corresponding path program 1 times [2025-02-06 13:22:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:34,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212638487] [2025-02-06 13:22:34,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:34,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:22:34,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:22:34,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:34,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:34,810 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:34,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:34,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212638487] [2025-02-06 13:22:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212638487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:34,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:34,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803394924] [2025-02-06 13:22:34,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:34,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:34,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:34,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:34,811 INFO L87 Difference]: Start difference. First operand 178 states and 222 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:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:34,858 INFO L93 Difference]: Finished difference Result 180 states and 225 transitions. [2025-02-06 13:22:34,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:34,858 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:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:34,860 INFO L225 Difference]: With dead ends: 180 [2025-02-06 13:22:34,860 INFO L226 Difference]: Without dead ends: 178 [2025-02-06 13:22:34,860 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:34,862 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:34,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 277 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-06 13:22:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2025-02-06 13:22:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.3424657534246576) internal successors, (196), 158 states have internal predecessors, (196), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 208 transitions. [2025-02-06 13:22:34,869 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 208 transitions. Word has length 20 [2025-02-06 13:22:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:34,870 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 208 transitions. [2025-02-06 13:22:34,870 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:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 208 transitions. [2025-02-06 13:22:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:22:34,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:34,872 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:34,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:22:34,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:34,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1274282199, now seen corresponding path program 1 times [2025-02-06 13:22:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:34,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033521241] [2025-02-06 13:22:34,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:34,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:34,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:34,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:34,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:34,909 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:34,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033521241] [2025-02-06 13:22:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033521241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:34,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:34,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:34,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951722440] [2025-02-06 13:22:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:34,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:34,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:34,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:34,911 INFO L87 Difference]: Start difference. First operand 169 states and 208 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:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:34,998 INFO L93 Difference]: Finished difference Result 179 states and 218 transitions. [2025-02-06 13:22:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:34,999 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:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:35,000 INFO L225 Difference]: With dead ends: 179 [2025-02-06 13:22:35,001 INFO L226 Difference]: Without dead ends: 177 [2025-02-06 13:22:35,001 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:35,001 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 128 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:35,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 310 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-06 13:22:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 163. [2025-02-06 13:22:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.3309859154929577) internal successors, (189), 152 states have internal predecessors, (189), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2025-02-06 13:22:35,010 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 24 [2025-02-06 13:22:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:35,011 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2025-02-06 13:22:35,011 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:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2025-02-06 13:22:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:22:35,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:35,011 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:35,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:22:35,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:35,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1275574197, now seen corresponding path program 1 times [2025-02-06 13:22:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535514286] [2025-02-06 13:22:35,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:35,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:35,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:35,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:35,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:35,055 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:35,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:35,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535514286] [2025-02-06 13:22:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535514286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:35,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:35,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:35,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936436574] [2025-02-06 13:22:35,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:35,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:35,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:35,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:35,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:35,057 INFO L87 Difference]: Start difference. First operand 163 states and 201 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:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:35,143 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2025-02-06 13:22:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:35,151 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:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:35,152 INFO L225 Difference]: With dead ends: 172 [2025-02-06 13:22:35,152 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 13:22:35,152 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:35,152 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 118 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:35,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 311 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 13:22:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2025-02-06 13:22:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 142 states have (on average 1.323943661971831) internal successors, (188), 151 states have internal predecessors, (188), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2025-02-06 13:22:35,160 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 24 [2025-02-06 13:22:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:35,161 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2025-02-06 13:22:35,161 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:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2025-02-06 13:22:35,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 13:22:35,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:35,161 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:22:35,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:35,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2047909560, now seen corresponding path program 1 times [2025-02-06 13:22:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:35,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090496466] [2025-02-06 13:22:35,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:35,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:35,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 13:22:35,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 13:22:35,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:35,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:22:35,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:35,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090496466] [2025-02-06 13:22:35,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090496466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:35,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:35,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:35,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576875880] [2025-02-06 13:22:35,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:35,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:35,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:35,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:35,219 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:35,275 INFO L93 Difference]: Finished difference Result 318 states and 391 transitions. [2025-02-06 13:22:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:35,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-06 13:22:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:35,277 INFO L225 Difference]: With dead ends: 318 [2025-02-06 13:22:35,277 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 13:22:35,277 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:35,278 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:35,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 311 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 13:22:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 162. [2025-02-06 13:22:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 142 states have (on average 1.3028169014084507) internal successors, (185), 151 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2025-02-06 13:22:35,290 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 26 [2025-02-06 13:22:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:35,291 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2025-02-06 13:22:35,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2025-02-06 13:22:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 13:22:35,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:35,292 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:35,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:22:35,293 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:35,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1700899127, now seen corresponding path program 1 times [2025-02-06 13:22:35,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:35,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284936577] [2025-02-06 13:22:35,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:35,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:35,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:22:35,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:22:35,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:35,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:22:35,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:22:35,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:22:35,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:22:35,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:35,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:22:35,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 13:22:35,320 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:22:35,321 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-02-06 13:22:35,322 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-02-06 13:22:35,323 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-02-06 13:22:35,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-02-06 13:22:35,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:22:35,326 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:35,343 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:22:35,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:22:35 BoogieIcfgContainer [2025-02-06 13:22:35,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:22:35,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:22:35,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:22:35,347 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:22:35,347 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:32" (3/4) ... [2025-02-06 13:22:35,349 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 13:22:35,349 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:22:35,350 INFO L158 Benchmark]: Toolchain (without parser) took 3223.57ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 113.0MB in the beginning and 324.5MB in the end (delta: -211.6MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2025-02-06 13:22:35,350 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:35,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.91ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:22:35,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.24ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:35,351 INFO L158 Benchmark]: Boogie Preprocessor took 24.66ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:35,351 INFO L158 Benchmark]: IcfgBuilder took 433.16ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 66.8MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 13:22:35,351 INFO L158 Benchmark]: TraceAbstraction took 2498.25ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 66.3MB in the beginning and 324.6MB in the end (delta: -258.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:35,352 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 394.3MB. Free memory was 324.6MB in the beginning and 324.5MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:35,353 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.41ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.91ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 98.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.24ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.66ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 95.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 433.16ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 66.8MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2498.25ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 66.3MB in the beginning and 324.6MB in the end (delta: -258.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 394.3MB. Free memory was 324.6MB in the beginning and 324.5MB in the end (delta: 24.0kB). 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: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=1, eb=0] [L251] 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] [L251] RET, EXPR base2flt(0, 0) VAL [ea=1, eb=0] [L251] zero = base2flt(0, 0) [L252] 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: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: 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, 140 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 817 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 795 mSDsluCounter, 3622 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2340 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 856 IncrementalHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 1282 mSDtfsCounter, 856 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=6, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 134 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 50 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 36/40 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:22:35,366 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_1-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 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:22:37,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:22:37,350 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:22:37,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:22:37,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:22:37,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:22:37,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:22:37,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:22:37,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:22:37,379 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:22:37,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:22:37,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:22:37,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:22:37,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:22:37,380 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:22:37,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:22:37,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:22:37,380 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:22:37,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:22:37,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:22:37,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:22:37,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:22:37,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:22:37,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:37,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:22:37,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:22:37,383 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 -> 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 [2025-02-06 13:22:37,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:22:37,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:22:37,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:22:37,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:22:37,687 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:22:37,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2025-02-06 13:22:38,919 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa19de8e2/f82204248de8454e8323f7d282ad8618/FLAG9ae0e1ed5 [2025-02-06 13:22:39,127 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:22:39,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2025-02-06 13:22:39,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa19de8e2/f82204248de8454e8323f7d282ad8618/FLAG9ae0e1ed5 [2025-02-06 13:22:39,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa19de8e2/f82204248de8454e8323f7d282ad8618 [2025-02-06 13:22:39,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:22:39,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:22:39,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:39,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:22:39,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:22:39,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:39" (1/1) ... [2025-02-06 13:22:39,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6168a5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:39, skipping insertion in model container [2025-02-06 13:22:39,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:39" (1/1) ... [2025-02-06 13:22:39,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:22:39,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:39,683 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:22:39,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:39,728 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:22:39,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:39 WrapperNode [2025-02-06 13:22:39,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:39,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:39,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:22:39,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:22:39,735 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:39" (1/1) ... [2025-02-06 13:22:39,740 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:39" (1/1) ... [2025-02-06 13:22:39,759 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2025-02-06 13:22:39,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:39,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:22:39,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:22:39,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:22:39,770 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:39" (1/1) ... [2025-02-06 13:22:39,770 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:39" (1/1) ... [2025-02-06 13:22:39,777 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:39" (1/1) ... [2025-02-06 13:22:39,792 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:39,793 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:39" (1/1) ... [2025-02-06 13:22:39,797 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:39" (1/1) ... [2025-02-06 13:22:39,806 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:39" (1/1) ... [2025-02-06 13:22:39,807 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:39" (1/1) ... [2025-02-06 13:22:39,809 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:39" (1/1) ... [2025-02-06 13:22:39,814 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:39" (1/1) ... [2025-02-06 13:22:39,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:22:39,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:22:39,822 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:22:39,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:22:39,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:39" (1/1) ... [2025-02-06 13:22:39,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:39,857 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:39,867 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:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:22:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 13:22:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-06 13:22:39,888 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-06 13:22:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:22:39,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:22:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 13:22:39,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 13:22:39,943 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:22:39,945 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:22:40,275 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-02-06 13:22:40,276 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:22:40,289 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:22:40,292 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:22:40,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:40 BoogieIcfgContainer [2025-02-06 13:22:40,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:22:40,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:22:40,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:22:40,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:22:40,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:22:39" (1/3) ... [2025-02-06 13:22:40,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b8865a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:40, skipping insertion in model container [2025-02-06 13:22:40,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:39" (2/3) ... [2025-02-06 13:22:40,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b8865a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:40, skipping insertion in model container [2025-02-06 13:22:40,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:40" (3/3) ... [2025-02-06 13:22:40,303 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2025-02-06 13:22:40,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:22:40,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-3.c.cil.c that has 3 procedures, 116 locations, 1 initial locations, 2 loop locations, and 22 error locations. [2025-02-06 13:22:40,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:22:40,361 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;@632002cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:22:40,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-06 13:22:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 81 states have (on average 1.6666666666666667) internal successors, (135), 106 states have internal predecessors, (135), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 13:22:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:22:40,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:40,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:40,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:40,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1204500739, now seen corresponding path program 1 times [2025-02-06 13:22:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:22:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027558479] [2025-02-06 13:22:40,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:40,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:40,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:40,391 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:40,396 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:40,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:22:40,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:22:40,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:40,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:40,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:22:40,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:40,514 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:40,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:40,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:22:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027558479] [2025-02-06 13:22:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027558479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:40,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:40,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606921826] [2025-02-06 13:22:40,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:40,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:22:40,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:40,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:40,537 INFO L87 Difference]: Start difference. First operand has 116 states, 81 states have (on average 1.6666666666666667) internal successors, (135), 106 states have internal predecessors, (135), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 4 states have (on average 2.0) 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:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:40,618 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2025-02-06 13:22:40,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:40,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) 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:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:40,625 INFO L225 Difference]: With dead ends: 224 [2025-02-06 13:22:40,625 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 13:22:40,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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,629 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 4 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:40,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 398 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 13:22:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 13:22:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 72 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2025-02-06 13:22:40,659 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 9 [2025-02-06 13:22:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:40,659 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2025-02-06 13:22:40,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) 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:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2025-02-06 13:22:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:22:40,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:40,660 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:40,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 13:22:40,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:40,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:40,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash -486213056, now seen corresponding path program 1 times [2025-02-06 13:22:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:22:40,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519451460] [2025-02-06 13:22:40,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:40,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:40,869 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:40,870 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:40,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:22:40,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:22:40,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:40,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:40,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:22:40,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:22:40,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:40,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:22:40,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519451460] [2025-02-06 13:22:40,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519451460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:40,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:40,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:22:40,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521879817] [2025-02-06 13:22:40,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:40,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:22:40,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:40,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:40,922 INFO L87 Difference]: Start difference. First operand 82 states and 95 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:40,952 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2025-02-06 13:22:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:40,956 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-06 13:22:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:40,957 INFO L225 Difference]: With dead ends: 82 [2025-02-06 13:22:40,957 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 13:22:40,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:40,958 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:40,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 159 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 13:22:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 13:22:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 71 states have internal predecessors, (82), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2025-02-06 13:22:40,964 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 16 [2025-02-06 13:22:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:40,964 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2025-02-06 13:22:40,964 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2025-02-06 13:22:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:22:40,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:40,965 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:40,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:22:41,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:41,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:41,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:41,166 INFO L85 PathProgramCache]: Analyzing trace with hash 940739915, now seen corresponding path program 1 times [2025-02-06 13:22:41,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:22:41,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317113543] [2025-02-06 13:22:41,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:41,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:41,168 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:41,169 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:41,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:22:41,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:22:41,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:41,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:41,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 13:22:41,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:22:41,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:41,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:22:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317113543] [2025-02-06 13:22:41,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317113543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:41,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:41,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:22:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126633665] [2025-02-06 13:22:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:41,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:41,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:22:41,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:41,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:41,221 INFO L87 Difference]: Start difference. First operand 81 states and 94 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:41,255 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-02-06 13:22:41,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:41,259 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-02-06 13:22:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:41,260 INFO L225 Difference]: With dead ends: 81 [2025-02-06 13:22:41,260 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 13:22:41,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:41,260 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:41,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 13:22:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 13:22:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.35) internal successors, (81), 70 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2025-02-06 13:22:41,270 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 18 [2025-02-06 13:22:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:41,271 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-02-06 13:22:41,272 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2025-02-06 13:22:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 13:22:41,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:41,272 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:41,279 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,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:41,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:41,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1734507852, now seen corresponding path program 1 times [2025-02-06 13:22:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:22:41,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426219899] [2025-02-06 13:22:41,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:41,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:41,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:41,482 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:41,484 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:41,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 13:22:41,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 13:22:41,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:41,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:41,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:22:41,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:42,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:42,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 13:22:42,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426219899] [2025-02-06 13:22:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426219899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:42,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:42,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:22:42,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884504050] [2025-02-06 13:22:42,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:42,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:22:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 13:22:42,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:22:42,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:42,071 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:43,257 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2025-02-06 13:22:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:22:43,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-06 13:22:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:43,260 INFO L225 Difference]: With dead ends: 92 [2025-02-06 13:22:43,260 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 13:22:43,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:22:43,260 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 53 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:43,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 206 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 13:22:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 13:22:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2025-02-06 13:22:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3) internal successors, (78), 67 states have internal predecessors, (78), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 13:22:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2025-02-06 13:22:43,273 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 21 [2025-02-06 13:22:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:43,275 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2025-02-06 13:22:43,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 13:22:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2025-02-06 13:22:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:22:43,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:43,276 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:43,282 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,476 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 [2025-02-06 13:22:43,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-06 13:22:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash -28144135, now seen corresponding path program 1 times [2025-02-06 13:22:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 13:22:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493842658] [2025-02-06 13:22:43,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:43,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:43,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:43,479 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,480 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,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:43,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:43,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:43,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:22:43,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 13:22:43,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:43,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:43,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:43,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 13:22:43,533 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 13:22:43,534 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 13:22:43,534 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-02-06 13:22:43,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-02-06 13:22:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-02-06 13:22:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-02-06 13:22:43,545 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:43,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:43,740 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 13:22:43,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:22:43,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:22:43 BoogieIcfgContainer [2025-02-06 13:22:43,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:22:43,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:22:43,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:22:43,768 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:22:43,769 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:40" (3/4) ... [2025-02-06 13:22:43,769 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 13:22:43,797 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 10. [2025-02-06 13:22:43,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:22:43,832 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:22:43,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:22:43,832 INFO L158 Benchmark]: Toolchain (without parser) took 4348.11ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 83.0MB in the end (delta: 9.2MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2025-02-06 13:22:43,834 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:43,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.61ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 77.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:22:43,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.61ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:43,835 INFO L158 Benchmark]: Boogie Preprocessor took 60.27ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 74.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:43,836 INFO L158 Benchmark]: IcfgBuilder took 471.18ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 52.3MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 13:22:43,836 INFO L158 Benchmark]: TraceAbstraction took 3472.98ms. Allocated memory is still 117.4MB. Free memory was 51.6MB in the beginning and 89.0MB in the end (delta: -37.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-02-06 13:22:43,836 INFO L158 Benchmark]: Witness Printer took 64.07ms. Allocated memory is still 117.4MB. Free memory was 89.0MB in the beginning and 83.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:22:43,838 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.28ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.61ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 77.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.61ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.27ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 74.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 471.18ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 52.3MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3472.98ms. Allocated memory is still 117.4MB. Free memory was 51.6MB in the beginning and 89.0MB in the end (delta: -37.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 64.07ms. Allocated memory is still 117.4MB. Free memory was 89.0MB in the beginning and 83.0MB in the end (delta: 5.9MB). 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 - CounterExampleResult [Line: 77]: integer overflow possible integer overflow possible We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] 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] [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] 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] m = m & ~ (1U << 24U) VAL [\old(e)=1, \old(m)=8388608, e=0, m=0] [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: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: 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, 116 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 921 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 538 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 383 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 60 ConstructedInterpolants, 11 QuantifiedInterpolants, 159 SizeOfPredicates, 2 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6/6 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 proved your program to be incorrect! [2025-02-06 13:22:43,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)