./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2.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 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:23:28,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:23:28,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:23:28,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:23:28,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:23:28,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:23:28,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:23:28,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:23:28,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:23:28,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:23:28,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:23:28,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:23:28,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:23:28,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:23:28,427 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:23:28,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:23:28,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:23:28,428 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:23:28,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:23:28,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:23:28,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:23:28,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:23:28,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:28,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:28,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:28,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:28,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:23:28,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:28,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:28,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:28,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:28,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:23:28,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:23:28,431 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:23:28,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:23:28,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:23:28,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:23:28,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:23:28,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:23:28,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:23:28,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:23:28,432 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 -> 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 [2025-01-10 01:23:28,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:23:28,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:23:28,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:23:28,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:23:28,731 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:23:28,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2025-01-10 01:23:30,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa7bfb16a/1b780526ac6a42fc8c45e05a58f13cf4/FLAG811ecf987 [2025-01-10 01:23:30,307 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:23:30,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2025-01-10 01:23:30,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa7bfb16a/1b780526ac6a42fc8c45e05a58f13cf4/FLAG811ecf987 [2025-01-10 01:23:30,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa7bfb16a/1b780526ac6a42fc8c45e05a58f13cf4 [2025-01-10 01:23:30,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:23:30,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:23:30,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:30,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:23:30,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:23:30,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eecfadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30, skipping insertion in model container [2025-01-10 01:23:30,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:23:30,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:30,580 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:23:30,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:30,654 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:23:30,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30 WrapperNode [2025-01-10 01:23:30,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:30,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:30,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:23:30,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:23:30,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,703 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 212 [2025-01-10 01:23:30,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:30,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:23:30,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:23:30,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:23:30,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,744 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-01-10 01:23:30,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:23:30,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:23:30,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:23:30,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:23:30,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (1/1) ... [2025-01-10 01:23:30,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:30,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:30,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:23:30,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:23:30,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:23:30,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:23:30,831 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-01-10 01:23:30,831 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-01-10 01:23:30,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:23:30,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:23:30,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:23:30,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:23:30,888 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:23:30,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:23:31,272 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-01-10 01:23:31,272 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:23:31,284 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:23:31,284 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:23:31,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:31 BoogieIcfgContainer [2025-01-10 01:23:31,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:23:31,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:23:31,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:23:31,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:23:31,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:23:30" (1/3) ... [2025-01-10 01:23:31,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a91aec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:31, skipping insertion in model container [2025-01-10 01:23:31,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:30" (2/3) ... [2025-01-10 01:23:31,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a91aec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:31, skipping insertion in model container [2025-01-10 01:23:31,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:31" (3/3) ... [2025-01-10 01:23:31,294 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-2.c.cil.c [2025-01-10 01:23:31,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:23:31,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-2.c.cil.c that has 3 procedures, 138 locations, 1 initial locations, 2 loop locations, and 22 error locations. [2025-01-10 01:23:31,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:23:31,368 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;@29cb799b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:23:31,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-10 01:23:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 105 states have (on average 1.6476190476190475) internal successors, (173), 129 states have internal predecessors, (173), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:23:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:23:31,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:31,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:31,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:31,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash -117057507, now seen corresponding path program 1 times [2025-01-10 01:23:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:31,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067265890] [2025-01-10 01:23:31,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:31,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:23:31,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:23:31,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:31,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:31,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067265890] [2025-01-10 01:23:31,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067265890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:31,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:31,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718285466] [2025-01-10 01:23:31,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:31,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:31,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:31,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:31,624 INFO L87 Difference]: Start difference. First operand has 138 states, 105 states have (on average 1.6476190476190475) internal successors, (173), 129 states have internal predecessors, (173), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:31,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:31,792 INFO L93 Difference]: Finished difference Result 323 states and 463 transitions. [2025-01-10 01:23:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:31,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:23:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:31,802 INFO L225 Difference]: With dead ends: 323 [2025-01-10 01:23:31,803 INFO L226 Difference]: Without dead ends: 156 [2025-01-10 01:23:31,807 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-01-10 01:23:31,809 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 85 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:31,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 487 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-10 01:23:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2025-01-10 01:23:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 118 states have (on average 1.5084745762711864) internal successors, (178), 135 states have internal predecessors, (178), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 188 transitions. [2025-01-10 01:23:31,850 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 188 transitions. Word has length 8 [2025-01-10 01:23:31,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:31,850 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 188 transitions. [2025-01-10 01:23:31,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2025-01-10 01:23:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:23:31,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:31,851 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:31,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:23:31,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:31,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash -737509086, now seen corresponding path program 1 times [2025-01-10 01:23:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:31,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76823528] [2025-01-10 01:23:31,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:31,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:31,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:23:31,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:23:31,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:31,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:23:31,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:31,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76823528] [2025-01-10 01:23:31,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76823528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:31,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:31,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434511931] [2025-01-10 01:23:31,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:31,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:31,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:31,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:31,908 INFO L87 Difference]: Start difference. First operand 144 states and 188 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:31,972 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2025-01-10 01:23:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-01-10 01:23:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:31,978 INFO L225 Difference]: With dead ends: 144 [2025-01-10 01:23:31,978 INFO L226 Difference]: Without dead ends: 143 [2025-01-10 01:23:31,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:31,979 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:31,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 216 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-10 01:23:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-01-10 01:23:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 134 states have internal predecessors, (176), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2025-01-10 01:23:32,003 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 186 transitions. Word has length 12 [2025-01-10 01:23:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:32,003 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 186 transitions. [2025-01-10 01:23:32,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2025-01-10 01:23:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:32,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:32,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:32,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:23:32,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:32,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 663342954, now seen corresponding path program 1 times [2025-01-10 01:23:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:32,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850485418] [2025-01-10 01:23:32,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:32,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:32,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:32,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:32,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:32,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850485418] [2025-01-10 01:23:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850485418] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:32,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095049430] [2025-01-10 01:23:32,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:32,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:32,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:32,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:32,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:23:32,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:32,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:32,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:32,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:32,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:32,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:32,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:32,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095049430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:32,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:32,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:32,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874128583] [2025-01-10 01:23:32,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:32,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:32,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:32,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:32,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:32,239 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-01-10 01:23:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:32,331 INFO L93 Difference]: Finished difference Result 171 states and 232 transitions. [2025-01-10 01:23:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 13 [2025-01-10 01:23:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:32,333 INFO L225 Difference]: With dead ends: 171 [2025-01-10 01:23:32,333 INFO L226 Difference]: Without dead ends: 169 [2025-01-10 01:23:32,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:32,334 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 25 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:32,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 315 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-10 01:23:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 151. [2025-01-10 01:23:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 142 states have internal predecessors, (186), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 196 transitions. [2025-01-10 01:23:32,347 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 196 transitions. Word has length 13 [2025-01-10 01:23:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:32,347 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 196 transitions. [2025-01-10 01:23:32,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-01-10 01:23:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 196 transitions. [2025-01-10 01:23:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:32,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:32,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:32,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:23:32,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:32,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:32,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1387945135, now seen corresponding path program 1 times [2025-01-10 01:23:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:32,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617720068] [2025-01-10 01:23:32,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:32,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:32,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:32,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:32,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:32,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:32,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:32,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617720068] [2025-01-10 01:23:32,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617720068] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:32,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219962299] [2025-01-10 01:23:32,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:32,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:32,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:32,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:23:32,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:32,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:32,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:32,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:32,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:32,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:32,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:32,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219962299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:32,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:32,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:23:32,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232330312] [2025-01-10 01:23:32,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:32,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:32,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:32,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:32,713 INFO L87 Difference]: Start difference. First operand 151 states and 196 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-01-10 01:23:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:32,770 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2025-01-10 01:23:32,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:32,775 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 13 [2025-01-10 01:23:32,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:32,777 INFO L225 Difference]: With dead ends: 156 [2025-01-10 01:23:32,777 INFO L226 Difference]: Without dead ends: 155 [2025-01-10 01:23:32,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:32,778 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 16 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:32,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 207 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-10 01:23:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2025-01-10 01:23:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.4724409448818898) internal successors, (187), 143 states have internal predecessors, (187), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 197 transitions. [2025-01-10 01:23:32,803 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 197 transitions. Word has length 13 [2025-01-10 01:23:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:32,803 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 197 transitions. [2025-01-10 01:23:32,803 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-01-10 01:23:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2025-01-10 01:23:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:32,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:32,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:32,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:33,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:33,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:33,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:33,006 INFO L85 PathProgramCache]: Analyzing trace with hash -911204825, now seen corresponding path program 1 times [2025-01-10 01:23:33,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:33,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099450462] [2025-01-10 01:23:33,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:33,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:33,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:33,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:33,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:23:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099450462] [2025-01-10 01:23:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099450462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:33,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:33,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300026211] [2025-01-10 01:23:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:33,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:33,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:33,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:33,045 INFO L87 Difference]: Start difference. First operand 152 states and 197 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-01-10 01:23:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:33,084 INFO L93 Difference]: Finished difference Result 152 states and 197 transitions. [2025-01-10 01:23:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:33,084 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-01-10 01:23:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:33,085 INFO L225 Difference]: With dead ends: 152 [2025-01-10 01:23:33,085 INFO L226 Difference]: Without dead ends: 151 [2025-01-10 01:23:33,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:33,086 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:33,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 210 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-10 01:23:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2025-01-10 01:23:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 125 states have (on average 1.464) internal successors, (183), 140 states have internal predecessors, (183), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2025-01-10 01:23:33,107 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 14 [2025-01-10 01:23:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:33,108 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2025-01-10 01:23:33,108 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-01-10 01:23:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2025-01-10 01:23:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:33,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:33,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:33,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:23:33,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:33,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:33,110 INFO L85 PathProgramCache]: Analyzing trace with hash -902522007, now seen corresponding path program 1 times [2025-01-10 01:23:33,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:33,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722289355] [2025-01-10 01:23:33,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:33,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:33,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:33,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:33,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:33,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:33,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722289355] [2025-01-10 01:23:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722289355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243491077] [2025-01-10 01:23:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:33,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:33,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:33,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:33,151 INFO L87 Difference]: Start difference. First operand 149 states and 193 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-01-10 01:23:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:33,204 INFO L93 Difference]: Finished difference Result 285 states and 367 transitions. [2025-01-10 01:23:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:33,205 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-01-10 01:23:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:33,206 INFO L225 Difference]: With dead ends: 285 [2025-01-10 01:23:33,206 INFO L226 Difference]: Without dead ends: 159 [2025-01-10 01:23:33,207 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-01-10 01:23:33,207 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 15 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:33,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 214 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-10 01:23:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2025-01-10 01:23:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 142 states have internal predecessors, (183), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 193 transitions. [2025-01-10 01:23:33,230 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 193 transitions. Word has length 14 [2025-01-10 01:23:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:33,230 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 193 transitions. [2025-01-10 01:23:33,231 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-01-10 01:23:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 193 transitions. [2025-01-10 01:23:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:23:33,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:33,234 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:33,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:23:33,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:33,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash -889062217, now seen corresponding path program 1 times [2025-01-10 01:23:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:33,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931449311] [2025-01-10 01:23:33,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:33,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:23:33,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:23:33,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:33,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:33,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:33,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931449311] [2025-01-10 01:23:33,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931449311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:33,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:33,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:33,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246156120] [2025-01-10 01:23:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:33,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:33,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:33,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:33,316 INFO L87 Difference]: Start difference. First operand 151 states and 193 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-01-10 01:23:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:33,450 INFO L93 Difference]: Finished difference Result 215 states and 276 transitions. [2025-01-10 01:23:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:33,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 16 [2025-01-10 01:23:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:33,452 INFO L225 Difference]: With dead ends: 215 [2025-01-10 01:23:33,452 INFO L226 Difference]: Without dead ends: 211 [2025-01-10 01:23:33,453 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-01-10 01:23:33,454 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 141 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:33,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 326 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-10 01:23:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 195. [2025-01-10 01:23:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 171 states have (on average 1.432748538011696) internal successors, (245), 185 states have internal predecessors, (245), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2025-01-10 01:23:33,477 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 16 [2025-01-10 01:23:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:33,477 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2025-01-10 01:23:33,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-01-10 01:23:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2025-01-10 01:23:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:23:33,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:33,478 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:33,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:23:33,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:33,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash -889799239, now seen corresponding path program 1 times [2025-01-10 01:23:33,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:33,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720590082] [2025-01-10 01:23:33,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:33,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:33,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:23:33,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:23:33,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:33,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:33,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:33,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720590082] [2025-01-10 01:23:33,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720590082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:33,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:33,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333203870] [2025-01-10 01:23:33,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:33,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:33,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:33,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:33,539 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-01-10 01:23:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:33,648 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2025-01-10 01:23:33,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:33,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 16 [2025-01-10 01:23:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:33,650 INFO L225 Difference]: With dead ends: 217 [2025-01-10 01:23:33,650 INFO L226 Difference]: Without dead ends: 215 [2025-01-10 01:23:33,651 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-01-10 01:23:33,651 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 141 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:33,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 331 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-10 01:23:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2025-01-10 01:23:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 173 states have (on average 1.4104046242774566) internal successors, (244), 187 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 254 transitions. [2025-01-10 01:23:33,667 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 254 transitions. Word has length 16 [2025-01-10 01:23:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:33,668 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 254 transitions. [2025-01-10 01:23:33,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-01-10 01:23:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 254 transitions. [2025-01-10 01:23:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:23:33,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:33,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:33,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:23:33,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:33,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1819584406, now seen corresponding path program 1 times [2025-01-10 01:23:33,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:33,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354502323] [2025-01-10 01:23:33,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:33,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:33,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:33,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:33,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:33,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:33,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354502323] [2025-01-10 01:23:33,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354502323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:33,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674139098] [2025-01-10 01:23:33,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:33,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:33,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:23:33,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:33,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:33,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:33,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:33,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:33,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:33,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:33,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674139098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:33,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:33,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:33,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387081375] [2025-01-10 01:23:33,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:33,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:33,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:33,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:33,798 INFO L87 Difference]: Start difference. First operand 197 states and 254 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) 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-01-10 01:23:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:33,849 INFO L93 Difference]: Finished difference Result 212 states and 275 transitions. [2025-01-10 01:23:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:33,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) 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-01-10 01:23:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:33,851 INFO L225 Difference]: With dead ends: 212 [2025-01-10 01:23:33,851 INFO L226 Difference]: Without dead ends: 211 [2025-01-10 01:23:33,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:33,851 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 13 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:33,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 221 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-10 01:23:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 197. [2025-01-10 01:23:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 173 states have (on average 1.3988439306358382) internal successors, (242), 187 states have internal predecessors, (242), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 252 transitions. [2025-01-10 01:23:33,864 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 252 transitions. Word has length 15 [2025-01-10 01:23:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:33,864 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 252 transitions. [2025-01-10 01:23:33,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) 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-01-10 01:23:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 252 transitions. [2025-01-10 01:23:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:23:33,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:33,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:33,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:34,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:34,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:34,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1075524317, now seen corresponding path program 1 times [2025-01-10 01:23:34,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:34,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776571766] [2025-01-10 01:23:34,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:34,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:34,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:34,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:34,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:34,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776571766] [2025-01-10 01:23:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776571766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:34,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:34,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047672800] [2025-01-10 01:23:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:34,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:34,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:34,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:34,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:34,104 INFO L87 Difference]: Start difference. First operand 197 states and 252 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) 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-01-10 01:23:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:34,156 INFO L93 Difference]: Finished difference Result 373 states and 473 transitions. [2025-01-10 01:23:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:34,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-01-10 01:23:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:34,158 INFO L225 Difference]: With dead ends: 373 [2025-01-10 01:23:34,158 INFO L226 Difference]: Without dead ends: 206 [2025-01-10 01:23:34,159 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-01-10 01:23:34,159 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:34,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 220 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-10 01:23:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 197. [2025-01-10 01:23:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 173 states have (on average 1.369942196531792) internal successors, (237), 187 states have internal predecessors, (237), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 247 transitions. [2025-01-10 01:23:34,175 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 247 transitions. Word has length 15 [2025-01-10 01:23:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:34,176 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 247 transitions. [2025-01-10 01:23:34,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-01-10 01:23:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 247 transitions. [2025-01-10 01:23:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:23:34,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:34,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:34,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:23:34,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:34,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:34,178 INFO L85 PathProgramCache]: Analyzing trace with hash 632961964, now seen corresponding path program 1 times [2025-01-10 01:23:34,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:34,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398289139] [2025-01-10 01:23:34,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:34,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:23:34,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:23:34,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:34,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:34,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398289139] [2025-01-10 01:23:34,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398289139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:34,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:34,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:34,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74054683] [2025-01-10 01:23:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:34,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:34,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:34,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:34,243 INFO L87 Difference]: Start difference. First operand 197 states and 247 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:34,295 INFO L93 Difference]: Finished difference Result 348 states and 435 transitions. [2025-01-10 01:23:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:34,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-10 01:23:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:34,297 INFO L225 Difference]: With dead ends: 348 [2025-01-10 01:23:34,297 INFO L226 Difference]: Without dead ends: 156 [2025-01-10 01:23:34,297 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-01-10 01:23:34,298 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:34,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 333 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-10 01:23:34,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-01-10 01:23:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 146 states have internal predecessors, (183), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2025-01-10 01:23:34,318 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2025-01-10 01:23:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:34,318 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2025-01-10 01:23:34,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2025-01-10 01:23:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:34,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:34,320 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:34,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:23:34,320 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:34,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:34,321 INFO L85 PathProgramCache]: Analyzing trace with hash 838033302, now seen corresponding path program 1 times [2025-01-10 01:23:34,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:34,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695737707] [2025-01-10 01:23:34,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:34,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:34,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:34,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:23:34,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695737707] [2025-01-10 01:23:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695737707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:34,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:34,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037698015] [2025-01-10 01:23:34,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:34,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:34,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:34,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:34,392 INFO L87 Difference]: Start difference. First operand 156 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, (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-01-10 01:23:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:34,487 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2025-01-10 01:23:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:34,487 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, (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 23 [2025-01-10 01:23:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:34,488 INFO L225 Difference]: With dead ends: 164 [2025-01-10 01:23:34,488 INFO L226 Difference]: Without dead ends: 161 [2025-01-10 01:23:34,488 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-01-10 01:23:34,489 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 132 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:34,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 375 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-10 01:23:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2025-01-10 01:23:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 132 states have (on average 1.371212121212121) internal successors, (181), 144 states have internal predecessors, (181), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2025-01-10 01:23:34,498 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 23 [2025-01-10 01:23:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:34,498 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2025-01-10 01:23:34,498 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, (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-01-10 01:23:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2025-01-10 01:23:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:34,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:34,499 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:34,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:23:34,499 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:34,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 837296280, now seen corresponding path program 1 times [2025-01-10 01:23:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:34,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133127093] [2025-01-10 01:23:34,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:34,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:34,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:34,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:23:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133127093] [2025-01-10 01:23:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133127093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:34,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:34,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219963540] [2025-01-10 01:23:34,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:34,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:34,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:34,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:34,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:34,546 INFO L87 Difference]: Start difference. First operand 154 states and 191 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, (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-01-10 01:23:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:34,645 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2025-01-10 01:23:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:34,645 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, (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 23 [2025-01-10 01:23:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:34,646 INFO L225 Difference]: With dead ends: 163 [2025-01-10 01:23:34,646 INFO L226 Difference]: Without dead ends: 161 [2025-01-10 01:23:34,647 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-01-10 01:23:34,647 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 136 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:34,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 382 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-10 01:23:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2025-01-10 01:23:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 134 states have internal predecessors, (169), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 179 transitions. [2025-01-10 01:23:34,656 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 179 transitions. Word has length 23 [2025-01-10 01:23:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:34,656 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 179 transitions. [2025-01-10 01:23:34,656 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, (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-01-10 01:23:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 179 transitions. [2025-01-10 01:23:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:34,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:34,657 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] [2025-01-10 01:23:34,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:23:34,657 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:34,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash 714338377, now seen corresponding path program 1 times [2025-01-10 01:23:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:34,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048385438] [2025-01-10 01:23:34,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:34,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:34,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:34,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:23:34,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:23:34,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:34,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:34,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:23:34,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:23:34,688 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:23:34,689 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-01-10 01:23:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-01-10 01:23:34,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-01-10 01:23:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-01-10 01:23:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-01-10 01:23:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-01-10 01:23:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-01-10 01:23:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-01-10 01:23:34,691 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-01-10 01:23:34,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-01-10 01:23:34,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-01-10 01:23:34,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-01-10 01:23:34,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-01-10 01:23:34,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-01-10 01:23:34,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-01-10 01:23:34,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-01-10 01:23:34,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-01-10 01:23:34,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-01-10 01:23:34,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-01-10 01:23:34,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-01-10 01:23:34,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-01-10 01:23:34,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-01-10 01:23:34,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:23:34,696 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:34,718 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:23:34,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:23:34 BoogieIcfgContainer [2025-01-10 01:23:34,721 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:23:34,721 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:23:34,722 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:23:34,722 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:23:34,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:31" (3/4) ... [2025-01-10 01:23:34,725 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 01:23:34,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:23:34,726 INFO L158 Benchmark]: Toolchain (without parser) took 4392.45ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 73.7MB in the end (delta: 40.4MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2025-01-10 01:23:34,726 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:34,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.83ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:23:34,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.89ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:34,727 INFO L158 Benchmark]: Boogie Preprocessor took 66.48ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:34,727 INFO L158 Benchmark]: RCFGBuilder took 513.68ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 69.5MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:23:34,727 INFO L158 Benchmark]: TraceAbstraction took 3434.52ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 73.8MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:34,728 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 73.7MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:34,729 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.91ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.83ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.89ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.48ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 513.68ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 69.5MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3434.52ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 73.8MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 73.7MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 80. Possible FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add ; [L237] unsigned int zero ; [L238] int sa ; [L239] int sb ; [L240] int tmp ; [L241] int tmp___0 ; [L242] int tmp___1 ; [L243] int tmp___2 ; [L244] int tmp___3 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L247] int tmp___6 ; [L248] int tmp___7 ; [L249] int tmp___8 ; [L250] int tmp___9 ; [L251] int __retres23 ; VAL [ea=0, eb=0] [L255] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L84] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L255] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L255] zero = base2flt(0, 0) [L256] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L80] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L80] m = m & ~ (1U << 24U) [L81] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: 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, 138 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 736 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 3837 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2296 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 706 IncrementalHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 1541 mSDtfsCounter, 706 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=8, InterpolantAutomatonStates: 55, 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, 13 MinimizatonAttempts, 124 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 35/42 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-01-10 01:23:34,746 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 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-2.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 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:23:37,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:23:37,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2025-01-10 01:23:37,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:23:37,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:23:37,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:23:37,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:23:37,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:23:37,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:23:37,199 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:23:37,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:23:37,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:23:37,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:23:37,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:23:37,201 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:23:37,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:23:37,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:23:37,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:23:37,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:23:37,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:23:37,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:23:37,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:23:37,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:23:37,203 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:23:37,203 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 01:23:37,203 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:23:37,203 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 01:23:37,203 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:23:37,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:23:37,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:23:37,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:23:37,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:23:37,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:23:37,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:37,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:37,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:37,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:37,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:23:37,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:37,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:37,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:37,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:37,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:23:37,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:23:37,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:23:37,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:23:37,206 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 01:23:37,207 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 01:23:37,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:23:37,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:23:37,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:23:37,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:23:37,207 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 -> 2cc7c06873dba45d738e292126bc5c4eeb8fbe341f5dfa6f9006be5a39c2b683 [2025-01-10 01:23:37,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:23:37,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:23:37,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:23:37,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:23:37,498 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:23:37,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2025-01-10 01:23:38,825 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27183d139/93b43f5d674d4c1aac22abf8e1bfb314/FLAGb1c39aaae [2025-01-10 01:23:39,092 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:23:39,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2.c.cil.c [2025-01-10 01:23:39,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27183d139/93b43f5d674d4c1aac22abf8e1bfb314/FLAGb1c39aaae [2025-01-10 01:23:39,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27183d139/93b43f5d674d4c1aac22abf8e1bfb314 [2025-01-10 01:23:39,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:23:39,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:23:39,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:39,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:23:39,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:23:39,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3116db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39, skipping insertion in model container [2025-01-10 01:23:39,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:23:39,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:39,622 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:23:39,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:39,686 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:23:39,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39 WrapperNode [2025-01-10 01:23:39,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:39,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:39,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:23:39,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:23:39,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,736 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 171 [2025-01-10 01:23:39,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:39,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:23:39,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:23:39,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:23:39,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,772 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-01-10 01:23:39,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:23:39,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:23:39,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:23:39,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:23:39,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (1/1) ... [2025-01-10 01:23:39,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:39,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:39,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:23:39,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:23:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:23:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 01:23:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-01-10 01:23:39,861 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-01-10 01:23:39,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:23:39,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:23:39,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:23:39,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:23:39,940 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:23:39,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:23:40,354 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-01-10 01:23:40,354 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:23:40,365 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:23:40,366 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:23:40,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:40 BoogieIcfgContainer [2025-01-10 01:23:40,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:23:40,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:23:40,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:23:40,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:23:40,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:23:39" (1/3) ... [2025-01-10 01:23:40,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd270a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:40, skipping insertion in model container [2025-01-10 01:23:40,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:39" (2/3) ... [2025-01-10 01:23:40,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd270a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:40, skipping insertion in model container [2025-01-10 01:23:40,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:40" (3/3) ... [2025-01-10 01:23:40,376 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-2.c.cil.c [2025-01-10 01:23:40,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:23:40,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-2.c.cil.c that has 3 procedures, 113 locations, 1 initial locations, 2 loop locations, and 22 error locations. [2025-01-10 01:23:40,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:23:40,444 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;@264a3bc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:23:40,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-10 01:23:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 80 states have (on average 1.6875) internal successors, (135), 104 states have internal predecessors, (135), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:23:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:23:40,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:40,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:40,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:40,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash 439720145, now seen corresponding path program 1 times [2025-01-10 01:23:40,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:23:40,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499687257] [2025-01-10 01:23:40,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:40,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:40,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:40,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:40,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:23:40,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:23:40,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:23:40,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:40,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:40,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:40,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:40,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:40,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:23:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499687257] [2025-01-10 01:23:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499687257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526239897] [2025-01-10 01:23:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:40,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:23:40,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:40,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:40,616 INFO L87 Difference]: Start difference. First operand has 113 states, 80 states have (on average 1.6875) internal successors, (135), 104 states have internal predecessors, (135), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:40,712 INFO L93 Difference]: Finished difference Result 218 states and 310 transitions. [2025-01-10 01:23:40,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:23:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:40,720 INFO L225 Difference]: With dead ends: 218 [2025-01-10 01:23:40,720 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 01:23:40,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-01-10 01:23:40,725 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 4 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 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-01-10 01:23:40,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 01:23:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 01:23:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 71 states have internal predecessors, (83), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2025-01-10 01:23:40,768 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 8 [2025-01-10 01:23:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:40,768 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-01-10 01:23:40,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2025-01-10 01:23:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:23:40,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:40,770 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:40,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:23:40,970 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-01-10 01:23:40,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:40,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash -93074251, now seen corresponding path program 1 times [2025-01-10 01:23:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:23:40,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943311473] [2025-01-10 01:23:40,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:40,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:40,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:40,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:23:41,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:41,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:41,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:41,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:41,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:23:41,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:23:41,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:41,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:23:41,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943311473] [2025-01-10 01:23:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943311473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388568347] [2025-01-10 01:23:41,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:41,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:41,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:23:41,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:41,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:41,032 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-01-10 01:23:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:41,086 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-01-10 01:23:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2025-01-10 01:23:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:41,090 INFO L225 Difference]: With dead ends: 80 [2025-01-10 01:23:41,091 INFO L226 Difference]: Without dead ends: 79 [2025-01-10 01:23:41,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:41,092 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 155 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-01-10 01:23:41,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 155 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-10 01:23:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-10 01:23:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 70 states have internal predecessors, (82), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2025-01-10 01:23:41,107 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 15 [2025-01-10 01:23:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:41,107 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2025-01-10 01:23:41,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-01-10 01:23:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2025-01-10 01:23:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:23:41,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:41,108 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:41,117 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-01-10 01:23:41,311 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-01-10 01:23:41,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:41,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:41,312 INFO L85 PathProgramCache]: Analyzing trace with hash 772807349, now seen corresponding path program 1 times [2025-01-10 01:23:41,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:23:41,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273540935] [2025-01-10 01:23:41,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:41,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:41,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:41,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:41,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:23:41,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:23:41,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:23:41,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:41,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:41,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:23:41,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:23:41,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:41,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:23:41,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273540935] [2025-01-10 01:23:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273540935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:41,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153830907] [2025-01-10 01:23:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:23:41,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:41,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:41,366 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-01-10 01:23:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:41,398 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-01-10 01:23:41,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:41,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 17 [2025-01-10 01:23:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:41,400 INFO L225 Difference]: With dead ends: 79 [2025-01-10 01:23:41,400 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:23:41,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:41,401 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 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-01-10 01:23:41,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:23:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 01:23:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 69 states have internal predecessors, (81), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2025-01-10 01:23:41,408 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 17 [2025-01-10 01:23:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:41,408 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2025-01-10 01:23:41,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-01-10 01:23:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2025-01-10 01:23:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:23:41,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:41,409 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:41,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:41,609 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-01-10 01:23:41,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:41,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:41,611 INFO L85 PathProgramCache]: Analyzing trace with hash 772874875, now seen corresponding path program 1 times [2025-01-10 01:23:41,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:23:41,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211025407] [2025-01-10 01:23:41,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:41,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:41,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:41,614 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-01-10 01:23:41,615 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-01-10 01:23:41,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:23:41,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:23:41,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:41,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:41,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:41,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:41,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:41,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 01:23:41,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211025407] [2025-01-10 01:23:41,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211025407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:41,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:41,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:41,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848851033] [2025-01-10 01:23:41,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:41,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:41,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 01:23:41,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:41,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:41,704 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-01-10 01:23:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:42,083 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2025-01-10 01:23:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:42,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-01-10 01:23:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:42,086 INFO L225 Difference]: With dead ends: 97 [2025-01-10 01:23:42,086 INFO L226 Difference]: Without dead ends: 94 [2025-01-10 01:23:42,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-01-10 01:23:42,087 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:42,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:23:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-10 01:23:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2025-01-10 01:23:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.353846153846154) internal successors, (88), 75 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2025-01-10 01:23:42,099 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 17 [2025-01-10 01:23:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:42,099 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2025-01-10 01:23:42,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-01-10 01:23:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2025-01-10 01:23:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:23:42,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:42,100 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:42,108 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-01-10 01:23:42,305 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-01-10 01:23:42,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 01:23:42,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -604182302, now seen corresponding path program 1 times [2025-01-10 01:23:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 01:23:42,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143905933] [2025-01-10 01:23:42,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:42,309 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-01-10 01:23:42,310 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-01-10 01:23:42,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:23:42,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:23:42,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:23:42,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:23:42,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:23:42,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:23:42,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:23:42,375 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 01:23:42,375 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:23:42,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-01-10 01:23:42,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-01-10 01:23:42,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-01-10 01:23:42,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-01-10 01:23:42,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-01-10 01:23:42,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-01-10 01:23:42,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-01-10 01:23:42,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-01-10 01:23:42,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-01-10 01:23:42,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-01-10 01:23:42,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-01-10 01:23:42,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-01-10 01:23:42,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-01-10 01:23:42,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-01-10 01:23:42,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-01-10 01:23:42,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-01-10 01:23:42,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-01-10 01:23:42,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-01-10 01:23:42,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-01-10 01:23:42,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-01-10 01:23:42,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-01-10 01:23:42,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-01-10 01:23:42,390 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-01-10 01:23:42,582 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-01-10 01:23:42,584 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 01:23:42,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:23:42,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:23:42 BoogieIcfgContainer [2025-01-10 01:23:42,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:23:42,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:23:42,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:23:42,602 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:23:42,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:40" (3/4) ... [2025-01-10 01:23:42,603 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 01:23:42,632 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-01-10 01:23:42,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:23:42,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:23:42,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:23:42,679 INFO L158 Benchmark]: Toolchain (without parser) took 3286.79ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 47.1MB in the end (delta: 44.8MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-01-10 01:23:42,679 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:42,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.28ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 76.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:23:42,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.16ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 75.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:42,679 INFO L158 Benchmark]: Boogie Preprocessor took 55.06ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:42,679 INFO L158 Benchmark]: RCFGBuilder took 575.58ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 51.6MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:23:42,680 INFO L158 Benchmark]: TraceAbstraction took 2231.44ms. Allocated memory is still 117.4MB. Free memory was 51.1MB in the beginning and 52.5MB in the end (delta: -1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:42,680 INFO L158 Benchmark]: Witness Printer took 74.90ms. Allocated memory is still 117.4MB. Free memory was 52.5MB in the beginning and 47.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:23:42,683 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.29ms. Allocated memory is still 83.9MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.28ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 76.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.16ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 75.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.06ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 575.58ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 51.6MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2231.44ms. Allocated memory is still 117.4MB. Free memory was 51.1MB in the beginning and 52.5MB in the end (delta: -1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 74.90ms. Allocated memory is still 117.4MB. Free memory was 52.5MB in the beginning and 47.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 81]: integer overflow possible integer overflow possible We found a FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add ; [L237] unsigned int zero ; [L238] int sa ; [L239] int sb ; [L240] int tmp ; [L241] int tmp___0 ; [L242] int tmp___1 ; [L243] int tmp___2 ; [L244] int tmp___3 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L247] int tmp___6 ; [L248] int tmp___7 ; [L249] int tmp___8 ; [L250] int tmp___9 ; [L251] int __retres23 ; [L255] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L84] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L255] RET, EXPR base2flt(0, 0) [L255] zero = base2flt(0, 0) [L256] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L80] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: 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, 113 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 881 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 507 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 374 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 53 ConstructedInterpolants, 7 QuantifiedInterpolants, 94 SizeOfPredicates, 2 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 10 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-01-10 01:23:42,701 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)