./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 13:14:22,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 13:14:22,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 13:14:22,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 13:14:22,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 13:14:22,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 13:14:22,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 13:14:22,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 13:14:22,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 13:14:22,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 13:14:22,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 13:14:22,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 13:14:22,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 13:14:22,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 13:14:22,469 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 13:14:22,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 13:14:22,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 13:14:22,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 13:14:22,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 13:14:22,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 13:14:22,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 13:14:22,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 13:14:22,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 13:14:22,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 13:14:22,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 13:14:22,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 13:14:22,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 13:14:22,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 13:14:22,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 13:14:22,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 13:14:22,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 13:14:22,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 13:14:22,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:14:22,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 13:14:22,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 13:14:22,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 13:14:22,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 13:14:22,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 13:14:22,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 13:14:22,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 13:14:22,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 13:14:22,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 13:14:22,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 13:14:22,472 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 ! call(reach_error())) ) 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2025-02-05 13:14:22,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 13:14:22,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 13:14:22,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 13:14:22,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 13:14:22,712 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 13:14:22,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2025-02-05 13:14:23,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4eb94361/eb21c95cd7cd45fda5e9d4f5b0572a05/FLAG598a737e3 [2025-02-05 13:14:24,030 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 13:14:24,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2025-02-05 13:14:24,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4eb94361/eb21c95cd7cd45fda5e9d4f5b0572a05/FLAG598a737e3 [2025-02-05 13:14:24,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4eb94361/eb21c95cd7cd45fda5e9d4f5b0572a05 [2025-02-05 13:14:24,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 13:14:24,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 13:14:24,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 13:14:24,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 13:14:24,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 13:14:24,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8339ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24, skipping insertion in model container [2025-02-05 13:14:24,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 13:14:24,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2025-02-05 13:14:24,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2025-02-05 13:14:24,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:14:24,215 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 13:14:24,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2025-02-05 13:14:24,236 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2025-02-05 13:14:24,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:14:24,248 INFO L204 MainTranslator]: Completed translation [2025-02-05 13:14:24,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24 WrapperNode [2025-02-05 13:14:24,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 13:14:24,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 13:14:24,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 13:14:24,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 13:14:24,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,273 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2025-02-05 13:14:24,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 13:14:24,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 13:14:24,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 13:14:24,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 13:14:24,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,300 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-05 13:14:24,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,307 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 13:14:24,314 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 13:14:24,315 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 13:14:24,315 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 13:14:24,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (1/1) ... [2025-02-05 13:14:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:14:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 13:14:24,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 13:14:24,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 13:14:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 13:14:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 13:14:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 13:14:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 13:14:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2025-02-05 13:14:24,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2025-02-05 13:14:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2025-02-05 13:14:24,360 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2025-02-05 13:14:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-05 13:14:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-05 13:14:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 13:14:24,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 13:14:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 13:14:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 13:14:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 13:14:24,418 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 13:14:24,419 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 13:14:24,597 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-02-05 13:14:24,597 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 13:14:24,606 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 13:14:24,608 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 13:14:24,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:14:24 BoogieIcfgContainer [2025-02-05 13:14:24,609 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 13:14:24,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 13:14:24,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 13:14:24,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 13:14:24,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 01:14:24" (1/3) ... [2025-02-05 13:14:24,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e8e878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:14:24, skipping insertion in model container [2025-02-05 13:14:24,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:24" (2/3) ... [2025-02-05 13:14:24,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e8e878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:14:24, skipping insertion in model container [2025-02-05 13:14:24,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:14:24" (3/3) ... [2025-02-05 13:14:24,617 INFO L128 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2025-02-05 13:14:24,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 13:14:24,630 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float_req_bl_1251.c that has 3 procedures, 58 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-02-05 13:14:24,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 13:14:24,672 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;@12e19ff7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 13:14:24,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-05 13:14:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 45 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 13:14:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 13:14:24,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:24,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:24,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-02-05 13:14:24,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash 924644075, now seen corresponding path program 1 times [2025-02-05 13:14:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 13:14:24,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999602773] [2025-02-05 13:14:24,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 13:14:24,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 13:14:24,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 13:14:24,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:24,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 13:14:24,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 13:14:24,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999602773] [2025-02-05 13:14:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999602773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:24,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:24,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778699907] [2025-02-05 13:14:24,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:24,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:24,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 13:14:24,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:24,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:24,847 INFO L87 Difference]: Start difference. First operand has 58 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 45 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:14:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:24,889 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2025-02-05 13:14:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 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-02-05 13:14:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:24,895 INFO L225 Difference]: With dead ends: 74 [2025-02-05 13:14:24,895 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 13:14:24,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:24,900 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:24,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 13:14:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-05 13:14:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 13:14:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-02-05 13:14:24,929 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2025-02-05 13:14:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:24,930 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-02-05 13:14:24,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:14:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-02-05 13:14:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 13:14:24,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:24,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:24,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 13:14:24,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-02-05 13:14:24,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1747261947, now seen corresponding path program 1 times [2025-02-05 13:14:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 13:14:24,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925592278] [2025-02-05 13:14:24,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 13:14:24,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 13:14:24,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 13:14:24,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:24,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 13:14:24,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 13:14:24,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 13:14:24,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 13:14:24,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:24,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 13:14:24,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 13:14:24,981 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 13:14:24,982 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 3 remaining) [2025-02-05 13:14:24,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-05 13:14:24,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-02-05 13:14:24,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 13:14:24,990 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-05 13:14:25,005 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 13:14:25,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 01:14:25 BoogieIcfgContainer [2025-02-05 13:14:25,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 13:14:25,007 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 13:14:25,007 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 13:14:25,007 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 13:14:25,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:14:24" (3/4) ... [2025-02-05 13:14:25,013 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 13:14:25,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 13:14:25,016 INFO L158 Benchmark]: Toolchain (without parser) took 946.92ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 51.1MB in the end (delta: 57.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 13:14:25,016 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:14:25,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.96ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 96.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:14:25,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.31ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:14:25,017 INFO L158 Benchmark]: Boogie Preprocessor took 38.39ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:14:25,017 INFO L158 Benchmark]: IcfgBuilder took 295.03ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 77.6MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:14:25,017 INFO L158 Benchmark]: TraceAbstraction took 395.72ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 51.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 13:14:25,017 INFO L158 Benchmark]: Witness Printer took 6.82ms. Allocated memory is still 142.6MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:14:25,019 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.96ms. Allocated memory is still 142.6MB. Free memory was 107.5MB in the beginning and 96.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.31ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.39ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 295.03ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 77.6MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 395.72ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 51.1MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 6.82ms. Allocated memory is still 142.6MB. Free memory is still 51.1MB. 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: 26]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 26, overapproximation of someBinaryFLOATComparisonOperation at line 57. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L69] CALL, EXPR isnan_float(x) VAL [\old(x)=55] [L57] return x != x; VAL [\old(x)=55, \result=1] [L69] RET, EXPR isnan_float(x) VAL [x=55] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [x=55] [L69] CALL, EXPR isnan_float(y) VAL [\old(x)=54] [L57] return x != x; VAL [\old(x)=54, \result=0] [L69] RET, EXPR isnan_float(y) VAL [x=55, y=54] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [x=55, y=54] [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [x=55, y=54] [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L72] CALL fmax_float(x, y) [L46] CALL __fpclassify_float(x) VAL [\old(x)=55] [L23] __uint32_t w; VAL [\old(x)=55] [L29] COND TRUE 0 VAL [\old(x)=55] [L26] ieee_float_shape_type gf_u; VAL [\old(x)=55] - UnprovableResult [Line: 82]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 13:14:25,037 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/float-newlib/float_req_bl_1251.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 13:14:27,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 13:14:27,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 13:14:27,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 13:14:27,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 13:14:27,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 13:14:27,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 13:14:27,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 13:14:27,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 13:14:27,221 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 13:14:27,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 13:14:27,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 13:14:27,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 13:14:27,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 13:14:27,224 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 13:14:27,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 13:14:27,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 13:14:27,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 13:14:27,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 13:14:27,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 13:14:27,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 13:14:27,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 13:14:27,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 13:14:27,225 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 13:14:27,225 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 13:14:27,226 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 13:14:27,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 13:14:27,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 13:14:27,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 13:14:27,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 13:14:27,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 13:14:27,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 13:14:27,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 13:14:27,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 13:14:27,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:14:27,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 13:14:27,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 13:14:27,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 13:14:27,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 13:14:27,227 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 13:14:27,227 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 13:14:27,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 13:14:27,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 13:14:27,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 13:14:27,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 13:14:27,228 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 ! call(reach_error())) ) 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2025-02-05 13:14:27,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 13:14:27,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 13:14:27,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 13:14:27,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 13:14:27,467 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 13:14:27,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2025-02-05 13:14:28,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82fa0f15f/6f94c0cf05004c71907c801ea3294ef6/FLAG16cbe04dd [2025-02-05 13:14:28,901 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 13:14:28,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2025-02-05 13:14:28,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82fa0f15f/6f94c0cf05004c71907c801ea3294ef6/FLAG16cbe04dd [2025-02-05 13:14:28,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82fa0f15f/6f94c0cf05004c71907c801ea3294ef6 [2025-02-05 13:14:28,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 13:14:28,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 13:14:28,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 13:14:28,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 13:14:28,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 13:14:28,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:14:28" (1/1) ... [2025-02-05 13:14:28,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5843a6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:28, skipping insertion in model container [2025-02-05 13:14:28,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:14:28" (1/1) ... [2025-02-05 13:14:28,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 13:14:29,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2025-02-05 13:14:29,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2025-02-05 13:14:29,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:14:29,067 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 13:14:29,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2025-02-05 13:14:29,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2025-02-05 13:14:29,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:14:29,105 INFO L204 MainTranslator]: Completed translation [2025-02-05 13:14:29,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29 WrapperNode [2025-02-05 13:14:29,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 13:14:29,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 13:14:29,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 13:14:29,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 13:14:29,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,139 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2025-02-05 13:14:29,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 13:14:29,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 13:14:29,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 13:14:29,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 13:14:29,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,163 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-05 13:14:29,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 13:14:29,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 13:14:29,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 13:14:29,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 13:14:29,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (1/1) ... [2025-02-05 13:14:29,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:14:29,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 13:14:29,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 13:14:29,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 13:14:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2025-02-05 13:14:29,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2025-02-05 13:14:29,250 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 13:14:29,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-05 13:14:29,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 13:14:29,306 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 13:14:29,308 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 13:14:29,482 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-05 13:14:29,482 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 13:14:29,489 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 13:14:29,489 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 13:14:29,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:14:29 BoogieIcfgContainer [2025-02-05 13:14:29,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 13:14:29,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 13:14:29,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 13:14:29,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 13:14:29,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 01:14:28" (1/3) ... [2025-02-05 13:14:29,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7357063d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:14:29, skipping insertion in model container [2025-02-05 13:14:29,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:14:29" (2/3) ... [2025-02-05 13:14:29,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7357063d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:14:29, skipping insertion in model container [2025-02-05 13:14:29,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:14:29" (3/3) ... [2025-02-05 13:14:29,496 INFO L128 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2025-02-05 13:14:29,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 13:14:29,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float_req_bl_1251.c that has 3 procedures, 53 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-05 13:14:29,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 13:14:29,544 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;@6e85d04d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 13:14:29,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 13:14:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 40 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 13:14:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 13:14:29,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:29,551 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:29,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:29,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1048560086, now seen corresponding path program 1 times [2025-02-05 13:14:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031912193] [2025-02-05 13:14:29,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:29,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:29,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:29,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:29,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 13:14:29,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 13:14:29,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 13:14:29,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:29,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:29,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 13:14:29,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 13:14:29,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:29,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031912193] [2025-02-05 13:14:29,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031912193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:29,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:29,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 13:14:29,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709678643] [2025-02-05 13:14:29,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:29,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 13:14:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:29,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 13:14:29,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 13:14:29,669 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 40 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:14:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:29,684 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2025-02-05 13:14:29,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 13:14:29,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-02-05 13:14:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:29,690 INFO L225 Difference]: With dead ends: 89 [2025-02-05 13:14:29,690 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 13:14:29,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 13:14:29,694 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:29,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 13:14:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-05 13:14:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 13:14:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2025-02-05 13:14:29,721 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 27 [2025-02-05 13:14:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:29,722 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-02-05 13:14:29,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:14:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2025-02-05 13:14:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 13:14:29,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:29,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:29,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 13:14:29,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:29,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:29,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:29,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1677675808, now seen corresponding path program 1 times [2025-02-05 13:14:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384926090] [2025-02-05 13:14:29,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:29,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:29,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:29,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:29,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 13:14:29,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 13:14:30,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 13:14:30,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:30,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:30,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:30,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 13:14:30,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:30,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:30,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384926090] [2025-02-05 13:14:30,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384926090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:30,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158206773] [2025-02-05 13:14:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:30,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:30,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:30,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:30,053 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:14:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:30,094 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2025-02-05 13:14:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-02-05 13:14:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:30,095 INFO L225 Difference]: With dead ends: 85 [2025-02-05 13:14:30,095 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 13:14:30,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:30,097 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:30,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 13:14:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-05 13:14:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 13:14:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2025-02-05 13:14:30,104 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 28 [2025-02-05 13:14:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:30,104 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2025-02-05 13:14:30,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:14:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2025-02-05 13:14:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 13:14:30,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:30,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:30,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-05 13:14:30,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:30,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1505348680, now seen corresponding path program 1 times [2025-02-05 13:14:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171838961] [2025-02-05 13:14:30,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:30,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:30,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:30,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:30,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 13:14:30,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 13:14:30,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 13:14:30,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:30,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:30,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:30,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 13:14:30,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:30,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:30,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171838961] [2025-02-05 13:14:30,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171838961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:30,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:30,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481137131] [2025-02-05 13:14:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:30,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:30,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:30,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:30,379 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:14:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:30,396 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2025-02-05 13:14:30,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:30,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-02-05 13:14:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:30,398 INFO L225 Difference]: With dead ends: 74 [2025-02-05 13:14:30,398 INFO L226 Difference]: Without dead ends: 54 [2025-02-05 13:14:30,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:30,399 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:30,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-05 13:14:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-05 13:14:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-05 13:14:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-02-05 13:14:30,405 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 33 [2025-02-05 13:14:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:30,405 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-02-05 13:14:30,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:14:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-02-05 13:14:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 13:14:30,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:30,406 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:30,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 13:14:30,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:30,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:30,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1314170174, now seen corresponding path program 1 times [2025-02-05 13:14:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:30,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345273827] [2025-02-05 13:14:30,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:30,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:30,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:30,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:30,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 13:14:30,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 13:14:30,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 13:14:30,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:30,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:30,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:30,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 13:14:30,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:30,683 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:30,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345273827] [2025-02-05 13:14:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345273827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:30,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712744316] [2025-02-05 13:14:30,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:30,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:30,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:30,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:30,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:30,685 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:14:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:30,713 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2025-02-05 13:14:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-02-05 13:14:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:30,714 INFO L225 Difference]: With dead ends: 77 [2025-02-05 13:14:30,714 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 13:14:30,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:30,715 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:30,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 13:14:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-02-05 13:14:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-05 13:14:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-02-05 13:14:30,726 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 34 [2025-02-05 13:14:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:30,727 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-02-05 13:14:30,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:14:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-02-05 13:14:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 13:14:30,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:30,729 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:30,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 13:14:30,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:30,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:30,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:30,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1035110459, now seen corresponding path program 1 times [2025-02-05 13:14:30,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:30,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363555600] [2025-02-05 13:14:30,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:30,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:30,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:30,936 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:30,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-05 13:14:30,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 13:14:30,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 13:14:30,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:30,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:30,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:30,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 13:14:30,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:30,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363555600] [2025-02-05 13:14:30,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363555600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:30,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:30,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:30,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265699605] [2025-02-05 13:14:30,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:30,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:30,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:31,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:31,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:31,000 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:14:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:31,017 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2025-02-05 13:14:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:31,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-02-05 13:14:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:31,018 INFO L225 Difference]: With dead ends: 77 [2025-02-05 13:14:31,018 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 13:14:31,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:31,019 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:31,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 13:14:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-02-05 13:14:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-05 13:14:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-02-05 13:14:31,023 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 35 [2025-02-05 13:14:31,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:31,023 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-02-05 13:14:31,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:14:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-02-05 13:14:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 13:14:31,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:31,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:31,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-02-05 13:14:31,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:31,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:31,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1566080293, now seen corresponding path program 1 times [2025-02-05 13:14:31,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:31,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894121695] [2025-02-05 13:14:31,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:31,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:31,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:31,231 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:31,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-05 13:14:31,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 13:14:31,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 13:14:31,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:31,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:31,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:31,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 13:14:31,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:31,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:31,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894121695] [2025-02-05 13:14:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894121695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:31,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:31,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:31,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387625852] [2025-02-05 13:14:31,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:31,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:31,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:31,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:31,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:31,308 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:14:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:31,327 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2025-02-05 13:14:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:31,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2025-02-05 13:14:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:31,329 INFO L225 Difference]: With dead ends: 77 [2025-02-05 13:14:31,329 INFO L226 Difference]: Without dead ends: 57 [2025-02-05 13:14:31,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:31,330 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:31,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-05 13:14:31,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-02-05 13:14:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-05 13:14:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2025-02-05 13:14:31,335 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 36 [2025-02-05 13:14:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:31,335 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2025-02-05 13:14:31,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:14:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2025-02-05 13:14:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 13:14:31,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:31,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:31,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-05 13:14:31,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:31,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:31,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:31,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1272677286, now seen corresponding path program 1 times [2025-02-05 13:14:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:31,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419122129] [2025-02-05 13:14:31,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:31,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:31,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:31,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-05 13:14:31,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 13:14:31,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 13:14:31,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:31,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:31,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 13:14:31,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 13:14:32,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 13:14:32,724 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419122129] [2025-02-05 13:14:32,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419122129] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 13:14:32,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:32,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2025-02-05 13:14:32,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162991311] [2025-02-05 13:14:32,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:32,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 13:14:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:32,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 13:14:32,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 13:14:32,727 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:33,096 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2025-02-05 13:14:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 13:14:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2025-02-05 13:14:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:33,101 INFO L225 Difference]: With dead ends: 96 [2025-02-05 13:14:33,101 INFO L226 Difference]: Without dead ends: 82 [2025-02-05 13:14:33,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-05 13:14:33,104 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 58 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:33,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 524 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 13:14:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-05 13:14:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2025-02-05 13:14:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2025-02-05 13:14:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2025-02-05 13:14:33,120 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 36 [2025-02-05 13:14:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:33,120 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2025-02-05 13:14:33,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2025-02-05 13:14:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 13:14:33,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:33,125 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:33,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-05 13:14:33,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:33,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:33,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1895634259, now seen corresponding path program 1 times [2025-02-05 13:14:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:33,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375970698] [2025-02-05 13:14:33,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:33,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:33,329 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:33,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-05 13:14:33,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 13:14:33,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 13:14:33,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:33,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:33,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 13:14:33,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 13:14:33,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:33,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:33,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375970698] [2025-02-05 13:14:33,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375970698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:33,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:33,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 13:14:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318442035] [2025-02-05 13:14:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:33,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 13:14:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:33,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 13:14:33,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 13:14:33,506 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 13:14:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:33,707 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2025-02-05 13:14:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 13:14:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2025-02-05 13:14:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:33,708 INFO L225 Difference]: With dead ends: 119 [2025-02-05 13:14:33,708 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 13:14:33,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 13:14:33,709 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:33,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 482 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 13:14:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 13:14:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2025-02-05 13:14:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2025-02-05 13:14:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2025-02-05 13:14:33,719 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 38 [2025-02-05 13:14:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:33,719 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2025-02-05 13:14:33,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 13:14:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2025-02-05 13:14:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 13:14:33,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:33,720 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:33,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-05 13:14:33,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:33,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash 845391184, now seen corresponding path program 1 times [2025-02-05 13:14:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:33,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685248959] [2025-02-05 13:14:33,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:33,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:33,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:33,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:33,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-05 13:14:33,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 13:14:34,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 13:14:34,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:34,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:34,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 13:14:34,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 13:14:34,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 13:14:34,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685248959] [2025-02-05 13:14:34,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685248959] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 13:14:34,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:34,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-02-05 13:14:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482256894] [2025-02-05 13:14:34,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:34,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 13:14:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:34,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 13:14:34,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-02-05 13:14:34,328 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 13:14:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:34,632 INFO L93 Difference]: Finished difference Result 108 states and 152 transitions. [2025-02-05 13:14:34,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 13:14:34,632 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2025-02-05 13:14:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:34,633 INFO L225 Difference]: With dead ends: 108 [2025-02-05 13:14:34,633 INFO L226 Difference]: Without dead ends: 106 [2025-02-05 13:14:34,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-02-05 13:14:34,634 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 36 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:34,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 423 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 13:14:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-05 13:14:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2025-02-05 13:14:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2025-02-05 13:14:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-02-05 13:14:34,641 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 41 [2025-02-05 13:14:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:34,641 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-02-05 13:14:34,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 13:14:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-02-05 13:14:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 13:14:34,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:34,644 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:34,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-02-05 13:14:34,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:34,848 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:34,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash -915754176, now seen corresponding path program 1 times [2025-02-05 13:14:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203939174] [2025-02-05 13:14:34,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:34,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:34,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:34,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:34,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-05 13:14:34,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 13:14:34,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 13:14:34,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:34,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:34,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 13:14:34,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 13:14:34,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:34,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:34,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203939174] [2025-02-05 13:14:34,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203939174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:34,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:34,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 13:14:34,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032172820] [2025-02-05 13:14:34,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:34,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 13:14:34,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:34,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 13:14:34,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 13:14:34,900 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 13:14:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:34,909 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2025-02-05 13:14:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 13:14:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-02-05 13:14:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:34,910 INFO L225 Difference]: With dead ends: 83 [2025-02-05 13:14:34,910 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 13:14:34,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 13:14:34,911 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:34,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 13:14:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2025-02-05 13:14:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2025-02-05 13:14:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-02-05 13:14:34,915 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 43 [2025-02-05 13:14:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:34,916 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-02-05 13:14:34,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 13:14:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-02-05 13:14:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 13:14:34,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:34,917 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:34,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2025-02-05 13:14:35,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:35,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:35,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1830142803, now seen corresponding path program 1 times [2025-02-05 13:14:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517060262] [2025-02-05 13:14:35,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:35,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:35,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:35,122 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:35,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-05 13:14:35,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 13:14:35,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 13:14:35,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:35,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:35,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:35,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 13:14:35,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:35,187 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:35,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517060262] [2025-02-05 13:14:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517060262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:35,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:35,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660773894] [2025-02-05 13:14:35,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:35,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:35,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:35,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:35,189 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:35,203 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2025-02-05 13:14:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:35,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2025-02-05 13:14:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:35,205 INFO L225 Difference]: With dead ends: 109 [2025-02-05 13:14:35,205 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 13:14:35,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:35,206 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:35,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 13:14:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 13:14:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.25) internal successors, (75), 59 states have internal predecessors, (75), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2025-02-05 13:14:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2025-02-05 13:14:35,211 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 46 [2025-02-05 13:14:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:35,211 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2025-02-05 13:14:35,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2025-02-05 13:14:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 13:14:35,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:35,212 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:35,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-02-05 13:14:35,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:35,412 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:35,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1184960815, now seen corresponding path program 1 times [2025-02-05 13:14:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522177701] [2025-02-05 13:14:35,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:35,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:35,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:35,416 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:35,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-05 13:14:35,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 13:14:35,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 13:14:35,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:35,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:35,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 13:14:35,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 13:14:35,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 13:14:36,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522177701] [2025-02-05 13:14:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522177701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 13:14:36,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-02-05 13:14:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449467910] [2025-02-05 13:14:36,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:36,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 13:14:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:36,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 13:14:36,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-02-05 13:14:36,523 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-05 13:14:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:37,570 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2025-02-05 13:14:37,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 13:14:37,570 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Word has length 46 [2025-02-05 13:14:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:37,572 INFO L225 Difference]: With dead ends: 147 [2025-02-05 13:14:37,572 INFO L226 Difference]: Without dead ends: 110 [2025-02-05 13:14:37,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-02-05 13:14:37,573 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:37,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 752 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 13:14:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-05 13:14:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2025-02-05 13:14:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.25) internal successors, (75), 59 states have internal predecessors, (75), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (26), 22 states have call predecessors, (26), 18 states have call successors, (26) [2025-02-05 13:14:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-02-05 13:14:37,582 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 46 [2025-02-05 13:14:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:37,582 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-02-05 13:14:37,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-05 13:14:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-02-05 13:14:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 13:14:37,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:37,582 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:37,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-05 13:14:37,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:37,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:37,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1545276669, now seen corresponding path program 1 times [2025-02-05 13:14:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:37,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537215737] [2025-02-05 13:14:37,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:37,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:37,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:37,797 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:37,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-05 13:14:37,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 13:14:37,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 13:14:37,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:37,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:37,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 13:14:37,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 13:14:37,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 13:14:38,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:38,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537215737] [2025-02-05 13:14:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537215737] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 13:14:38,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:38,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2025-02-05 13:14:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032391924] [2025-02-05 13:14:38,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:38,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 13:14:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:38,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 13:14:38,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 13:14:38,257 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 13:14:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:38,518 INFO L93 Difference]: Finished difference Result 104 states and 141 transitions. [2025-02-05 13:14:38,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 13:14:38,518 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2025-02-05 13:14:38,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:38,519 INFO L225 Difference]: With dead ends: 104 [2025-02-05 13:14:38,521 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 13:14:38,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-05 13:14:38,521 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:38,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 446 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 13:14:38,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 13:14:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-02-05 13:14:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 57 states have internal predecessors, (69), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (24), 19 states have call predecessors, (24), 17 states have call successors, (24) [2025-02-05 13:14:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2025-02-05 13:14:38,525 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 48 [2025-02-05 13:14:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:38,526 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2025-02-05 13:14:38,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 13:14:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2025-02-05 13:14:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 13:14:38,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:38,526 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:38,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2025-02-05 13:14:38,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:38,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:38,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:38,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1622759095, now seen corresponding path program 1 times [2025-02-05 13:14:38,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:38,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8407096] [2025-02-05 13:14:38,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:38,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:38,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:38,732 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:38,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-02-05 13:14:38,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 13:14:38,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 13:14:38,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:38,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:38,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:38,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 13:14:38,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:38,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8407096] [2025-02-05 13:14:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8407096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:38,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143272230] [2025-02-05 13:14:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:38,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:38,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:38,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:38,801 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:38,813 INFO L93 Difference]: Finished difference Result 111 states and 153 transitions. [2025-02-05 13:14:38,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:38,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-02-05 13:14:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:38,814 INFO L225 Difference]: With dead ends: 111 [2025-02-05 13:14:38,814 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 13:14:38,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:38,814 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:38,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 13:14:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-02-05 13:14:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 17 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (29), 20 states have call predecessors, (29), 17 states have call successors, (29) [2025-02-05 13:14:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2025-02-05 13:14:38,822 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 48 [2025-02-05 13:14:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:38,822 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2025-02-05 13:14:38,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2025-02-05 13:14:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 13:14:38,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:38,823 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:38,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-02-05 13:14:39,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:39,024 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:39,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1392344523, now seen corresponding path program 1 times [2025-02-05 13:14:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:39,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246115653] [2025-02-05 13:14:39,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:39,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:39,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:39,026 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:39,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-02-05 13:14:39,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 13:14:39,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 13:14:39,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:39,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:39,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 13:14:39,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 13:14:39,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:39,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:39,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246115653] [2025-02-05 13:14:39,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246115653] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 13:14:39,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1438206945] [2025-02-05 13:14:39,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:39,817 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 13:14:39,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 13:14:39,819 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 13:14:39,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-02-05 13:14:39,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 13:14:40,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 13:14:40,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:40,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:40,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 13:14:40,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 13:14:40,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:40,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1438206945] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 13:14:40,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:40,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2025-02-05 13:14:40,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978299515] [2025-02-05 13:14:40,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:40,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 13:14:40,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:40,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 13:14:40,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-02-05 13:14:40,283 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 13:14:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:40,605 INFO L93 Difference]: Finished difference Result 104 states and 145 transitions. [2025-02-05 13:14:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 13:14:40,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2025-02-05 13:14:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:40,606 INFO L225 Difference]: With dead ends: 104 [2025-02-05 13:14:40,606 INFO L226 Difference]: Without dead ends: 94 [2025-02-05 13:14:40,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-02-05 13:14:40,607 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 43 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:40,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 437 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 13:14:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-05 13:14:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2025-02-05 13:14:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (31), 22 states have call predecessors, (31), 18 states have call successors, (31) [2025-02-05 13:14:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2025-02-05 13:14:40,612 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 48 [2025-02-05 13:14:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:40,612 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2025-02-05 13:14:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 13:14:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2025-02-05 13:14:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 13:14:40,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:40,613 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:40,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-02-05 13:14:40,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2025-02-05 13:14:41,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 13:14:41,014 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:41,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1674854097, now seen corresponding path program 1 times [2025-02-05 13:14:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:41,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408053018] [2025-02-05 13:14:41,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:41,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:41,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:41,017 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:41,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-02-05 13:14:41,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 13:14:41,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 13:14:41,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:41,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:41,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 13:14:41,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 13:14:41,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 13:14:41,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:41,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408053018] [2025-02-05 13:14:41,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408053018] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 13:14:41,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:41,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2025-02-05 13:14:41,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409486409] [2025-02-05 13:14:41,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:41,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 13:14:41,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:41,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 13:14:41,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-05 13:14:41,266 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 13:14:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:41,510 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2025-02-05 13:14:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 13:14:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 48 [2025-02-05 13:14:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:41,511 INFO L225 Difference]: With dead ends: 117 [2025-02-05 13:14:41,511 INFO L226 Difference]: Without dead ends: 75 [2025-02-05 13:14:41,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-02-05 13:14:41,511 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 40 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 454 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 13:14:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-05 13:14:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-02-05 13:14:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 14 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (23), 16 states have call predecessors, (23), 14 states have call successors, (23) [2025-02-05 13:14:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2025-02-05 13:14:41,520 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 48 [2025-02-05 13:14:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:41,520 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2025-02-05 13:14:41,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 13:14:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2025-02-05 13:14:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 13:14:41,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:41,521 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:41,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-02-05 13:14:41,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:41,722 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:41,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash 281290230, now seen corresponding path program 1 times [2025-02-05 13:14:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392889102] [2025-02-05 13:14:41,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:41,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:41,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:41,724 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:41,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-02-05 13:14:41,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 13:14:41,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 13:14:41,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:41,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:41,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 13:14:41,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 13:14:41,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 13:14:41,957 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:41,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392889102] [2025-02-05 13:14:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392889102] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 13:14:41,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:41,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2025-02-05 13:14:41,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673939746] [2025-02-05 13:14:41,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:41,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 13:14:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:41,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 13:14:41,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-05 13:14:41,958 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 13:14:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:42,111 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2025-02-05 13:14:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 13:14:42,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2025-02-05 13:14:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:42,112 INFO L225 Difference]: With dead ends: 86 [2025-02-05 13:14:42,112 INFO L226 Difference]: Without dead ends: 70 [2025-02-05 13:14:42,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-05 13:14:42,113 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:42,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 491 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 13:14:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-05 13:14:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-02-05 13:14:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (22), 15 states have call predecessors, (22), 13 states have call successors, (22) [2025-02-05 13:14:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-02-05 13:14:42,117 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 48 [2025-02-05 13:14:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:42,117 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-02-05 13:14:42,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 13:14:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-02-05 13:14:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 13:14:42,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:42,118 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:42,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-02-05 13:14:42,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:42,318 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:42,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1588731584, now seen corresponding path program 1 times [2025-02-05 13:14:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:42,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146336238] [2025-02-05 13:14:42,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:42,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:42,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:42,321 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:42,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-02-05 13:14:42,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 13:14:42,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 13:14:42,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:42,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:42,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:42,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 13:14:42,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:42,403 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:42,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146336238] [2025-02-05 13:14:42,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146336238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:42,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:42,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:42,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601277779] [2025-02-05 13:14:42,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:42,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:42,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:42,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:42,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:42,404 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:42,425 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2025-02-05 13:14:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:42,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-02-05 13:14:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:42,427 INFO L225 Difference]: With dead ends: 98 [2025-02-05 13:14:42,427 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 13:14:42,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:42,429 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:42,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 13:14:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-02-05 13:14:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (22), 15 states have call predecessors, (22), 13 states have call successors, (22) [2025-02-05 13:14:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-02-05 13:14:42,435 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 49 [2025-02-05 13:14:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:42,435 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-02-05 13:14:42,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-02-05 13:14:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 13:14:42,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:42,435 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:42,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2025-02-05 13:14:42,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:42,641 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:42,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash 157992646, now seen corresponding path program 1 times [2025-02-05 13:14:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:42,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765848515] [2025-02-05 13:14:42,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:42,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:42,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:42,643 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:42,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2025-02-05 13:14:42,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 13:14:42,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 13:14:42,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:42,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:42,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:42,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 13:14:42,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:42,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:42,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765848515] [2025-02-05 13:14:42,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765848515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:42,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688933630] [2025-02-05 13:14:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:42,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:42,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:42,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:42,701 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:42,744 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2025-02-05 13:14:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:42,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2025-02-05 13:14:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:42,745 INFO L225 Difference]: With dead ends: 96 [2025-02-05 13:14:42,745 INFO L226 Difference]: Without dead ends: 70 [2025-02-05 13:14:42,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:42,745 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:42,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-05 13:14:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2025-02-05 13:14:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (18), 15 states have call predecessors, (18), 13 states have call successors, (18) [2025-02-05 13:14:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2025-02-05 13:14:42,751 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 50 [2025-02-05 13:14:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:42,751 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-02-05 13:14:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 13:14:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2025-02-05 13:14:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 13:14:42,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:42,752 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:42,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2025-02-05 13:14:42,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:42,953 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:42,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:42,953 INFO L85 PathProgramCache]: Analyzing trace with hash -839079707, now seen corresponding path program 1 times [2025-02-05 13:14:42,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:42,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454299819] [2025-02-05 13:14:42,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:42,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:42,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:42,955 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:42,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2025-02-05 13:14:42,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 13:14:43,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 13:14:43,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:43,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:43,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 13:14:43,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:43,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 13:14:43,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-05 13:14:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 13:14:43,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:43,390 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:43,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454299819] [2025-02-05 13:14:43,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454299819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:43,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:43,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 13:14:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536764123] [2025-02-05 13:14:43,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:43,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 13:14:43,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:43,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 13:14:43,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 13:14:43,391 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 13:14:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:43,865 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2025-02-05 13:14:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 13:14:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2025-02-05 13:14:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:43,866 INFO L225 Difference]: With dead ends: 70 [2025-02-05 13:14:43,866 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 13:14:43,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-02-05 13:14:43,867 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:43,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 350 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 13:14:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 13:14:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-02-05 13:14:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 13:14:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-02-05 13:14:43,869 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 50 [2025-02-05 13:14:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:43,869 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-02-05 13:14:43,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 13:14:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-02-05 13:14:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 13:14:43,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:43,871 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:43,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2025-02-05 13:14:44,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:44,073 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:44,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1024068808, now seen corresponding path program 1 times [2025-02-05 13:14:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:44,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981664177] [2025-02-05 13:14:44,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:44,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:44,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:44,075 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:44,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2025-02-05 13:14:44,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 13:14:44,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 13:14:44,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:44,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:44,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 13:14:44,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 13:14:44,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 13:14:45,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:45,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981664177] [2025-02-05 13:14:45,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981664177] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 13:14:45,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:45,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2025-02-05 13:14:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504503509] [2025-02-05 13:14:45,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:45,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 13:14:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:45,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 13:14:45,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-02-05 13:14:45,517 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 13:14:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:46,018 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2025-02-05 13:14:46,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 13:14:46,018 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 55 [2025-02-05 13:14:46,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:46,019 INFO L225 Difference]: With dead ends: 78 [2025-02-05 13:14:46,019 INFO L226 Difference]: Without dead ends: 47 [2025-02-05 13:14:46,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-02-05 13:14:46,020 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:46,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 376 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 13:14:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-05 13:14:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-02-05 13:14:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-05 13:14:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-02-05 13:14:46,024 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 55 [2025-02-05 13:14:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:46,024 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-02-05 13:14:46,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 13:14:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-02-05 13:14:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 13:14:46,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:46,025 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:46,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2025-02-05 13:14:46,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:46,225 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:46,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash -846963323, now seen corresponding path program 1 times [2025-02-05 13:14:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:46,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739246986] [2025-02-05 13:14:46,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:46,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:46,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:46,228 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:46,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2025-02-05 13:14:46,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 13:14:46,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 13:14:46,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:46,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:46,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 13:14:46,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:46,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 13:14:46,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-05 13:14:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 13:14:46,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:46,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739246986] [2025-02-05 13:14:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739246986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:46,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:46,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 13:14:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610736031] [2025-02-05 13:14:46,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:46,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 13:14:46,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:46,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 13:14:46,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 13:14:46,428 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 13:14:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:47,258 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2025-02-05 13:14:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 13:14:47,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2025-02-05 13:14:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:47,259 INFO L225 Difference]: With dead ends: 66 [2025-02-05 13:14:47,259 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 13:14:47,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 13:14:47,261 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:47,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 263 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 13:14:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 13:14:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-02-05 13:14:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 13:14:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-02-05 13:14:47,264 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 60 [2025-02-05 13:14:47,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:47,264 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-02-05 13:14:47,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 13:14:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-02-05 13:14:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 13:14:47,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:47,265 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:47,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2025-02-05 13:14:47,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:47,465 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:47,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash -183186521, now seen corresponding path program 1 times [2025-02-05 13:14:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:47,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752173327] [2025-02-05 13:14:47,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:47,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:47,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:47,468 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:47,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2025-02-05 13:14:47,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 13:14:47,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 13:14:47,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:47,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:47,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 13:14:47,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 13:14:47,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:47,683 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:47,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752173327] [2025-02-05 13:14:47,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752173327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:47,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:47,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 13:14:47,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532122674] [2025-02-05 13:14:47,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:47,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 13:14:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:47,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 13:14:47,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 13:14:47,684 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 13:14:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:47,934 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-02-05 13:14:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 13:14:47,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2025-02-05 13:14:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:47,935 INFO L225 Difference]: With dead ends: 68 [2025-02-05 13:14:47,935 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 13:14:47,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 13:14:47,936 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:47,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 270 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 13:14:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 13:14:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-02-05 13:14:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 13:14:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-02-05 13:14:47,938 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 61 [2025-02-05 13:14:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:47,938 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-02-05 13:14:47,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 13:14:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-02-05 13:14:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 13:14:47,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:47,939 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:47,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2025-02-05 13:14:48,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:48,139 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:48,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1074776200, now seen corresponding path program 1 times [2025-02-05 13:14:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:48,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427407328] [2025-02-05 13:14:48,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:48,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:48,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:48,143 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:48,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2025-02-05 13:14:48,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 13:14:48,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 13:14:48,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:48,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:48,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 13:14:48,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 13:14:48,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:48,337 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:48,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427407328] [2025-02-05 13:14:48,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427407328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:48,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:48,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 13:14:48,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020701063] [2025-02-05 13:14:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 13:14:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:48,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 13:14:48,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 13:14:48,338 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 13:14:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:49,280 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-02-05 13:14:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 13:14:49,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2025-02-05 13:14:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:49,281 INFO L225 Difference]: With dead ends: 68 [2025-02-05 13:14:49,281 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 13:14:49,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 13:14:49,282 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:49,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 270 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 13:14:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 13:14:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-02-05 13:14:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-05 13:14:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-02-05 13:14:49,284 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 62 [2025-02-05 13:14:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:49,284 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-02-05 13:14:49,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 13:14:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-02-05 13:14:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 13:14:49,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:49,285 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:49,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2025-02-05 13:14:49,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:49,486 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:49,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash -722334070, now seen corresponding path program 1 times [2025-02-05 13:14:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188790545] [2025-02-05 13:14:49,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:49,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:49,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:49,488 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:49,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2025-02-05 13:14:49,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 13:14:49,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 13:14:49,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:49,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:49,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 13:14:49,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 13:14:49,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:49,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188790545] [2025-02-05 13:14:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188790545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:49,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:49,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 13:14:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911679185] [2025-02-05 13:14:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:49,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 13:14:49,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:49,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 13:14:49,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 13:14:49,670 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 13:14:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:49,976 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-02-05 13:14:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 13:14:49,977 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2025-02-05 13:14:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:49,977 INFO L225 Difference]: With dead ends: 65 [2025-02-05 13:14:49,977 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 13:14:49,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 13:14:49,978 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:49,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 262 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 13:14:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 13:14:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-02-05 13:14:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 13:14:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-02-05 13:14:49,980 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 63 [2025-02-05 13:14:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:49,980 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-02-05 13:14:49,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 13:14:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-02-05 13:14:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 13:14:49,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:49,981 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:49,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2025-02-05 13:14:50,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:50,182 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:50,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1276569165, now seen corresponding path program 1 times [2025-02-05 13:14:50,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:50,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466027315] [2025-02-05 13:14:50,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:50,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:50,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:50,184 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:50,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2025-02-05 13:14:50,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 13:14:50,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 13:14:50,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:50,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:50,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 13:14:50,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:50,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 13:14:50,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-05 13:14:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 13:14:50,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 13:14:50,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:50,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466027315] [2025-02-05 13:14:50,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466027315] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 13:14:50,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:50,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-02-05 13:14:50,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512433148] [2025-02-05 13:14:50,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:50,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 13:14:50,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:50,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 13:14:50,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-05 13:14:50,607 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-02-05 13:14:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:51,081 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2025-02-05 13:14:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 13:14:51,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 63 [2025-02-05 13:14:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:51,082 INFO L225 Difference]: With dead ends: 64 [2025-02-05 13:14:51,082 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 13:14:51,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-02-05 13:14:51,083 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:51,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 356 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 13:14:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 13:14:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-02-05 13:14:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-05 13:14:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-02-05 13:14:51,086 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 63 [2025-02-05 13:14:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:51,086 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-02-05 13:14:51,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-02-05 13:14:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-02-05 13:14:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 13:14:51,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:51,086 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:51,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2025-02-05 13:14:51,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:51,287 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:51,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1495423883, now seen corresponding path program 1 times [2025-02-05 13:14:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504373951] [2025-02-05 13:14:51,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:51,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:51,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:51,289 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:51,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2025-02-05 13:14:51,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 13:14:51,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 13:14:51,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:51,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:51,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:14:51,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 13:14:51,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:14:51,357 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504373951] [2025-02-05 13:14:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504373951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:14:51,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:14:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:14:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355733441] [2025-02-05 13:14:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:14:51,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:14:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:51,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:14:51,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:51,358 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 13:14:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:51,369 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-02-05 13:14:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:14:51,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2025-02-05 13:14:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:51,370 INFO L225 Difference]: With dead ends: 66 [2025-02-05 13:14:51,370 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 13:14:51,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:14:51,370 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:51,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:14:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 13:14:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-05 13:14:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 13:14:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-02-05 13:14:51,372 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2025-02-05 13:14:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:51,373 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-02-05 13:14:51,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 13:14:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-02-05 13:14:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 13:14:51,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:14:51,374 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:51,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2025-02-05 13:14:51,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:51,575 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:14:51,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:14:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash -431584753, now seen corresponding path program 1 times [2025-02-05 13:14:51,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:14:51,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946014118] [2025-02-05 13:14:51,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:14:51,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:51,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:14:51,577 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 13:14:51,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2025-02-05 13:14:51,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 13:14:51,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 13:14:51,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:14:51,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:14:51,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 13:14:51,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:14:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 13:14:51,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 13:14:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 13:14:51,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:14:51,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946014118] [2025-02-05 13:14:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946014118] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 13:14:51,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 13:14:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-02-05 13:14:51,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687657593] [2025-02-05 13:14:51,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 13:14:51,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 13:14:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:14:51,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 13:14:51,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-05 13:14:51,860 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 13:14:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:14:51,952 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-02-05 13:14:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 13:14:51,952 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 64 [2025-02-05 13:14:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:14:51,953 INFO L225 Difference]: With dead ends: 46 [2025-02-05 13:14:51,953 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 13:14:51,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-02-05 13:14:51,953 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 13:14:51,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 267 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 13:14:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 13:14:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 13:14:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 13:14:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 13:14:51,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2025-02-05 13:14:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:14:51,954 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 13:14:51,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 13:14:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 13:14:51,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 13:14:51,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-05 13:14:51,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-05 13:14:51,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2025-02-05 13:14:52,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 13:14:52,159 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:14:52,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 13:14:53,019 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 13:14:53,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 01:14:53 BoogieIcfgContainer [2025-02-05 13:14:53,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 13:14:53,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 13:14:53,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 13:14:53,029 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 13:14:53,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:14:29" (3/4) ... [2025-02-05 13:14:53,031 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 13:14:53,035 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isnan_float [2025-02-05 13:14:53,035 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2025-02-05 13:14:53,038 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-05 13:14:53,038 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 13:14:53,039 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 13:14:53,039 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 13:14:53,060 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-02-05 13:14:53,076 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-02-05 13:14:53,110 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 13:14:53,111 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 13:14:53,111 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 13:14:53,111 INFO L158 Benchmark]: Toolchain (without parser) took 24186.81ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 57.6MB in the end (delta: 35.7MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2025-02-05 13:14:53,112 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:14:53,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.55ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 81.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:14:53,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.25ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:14:53,113 INFO L158 Benchmark]: Boogie Preprocessor took 43.39ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:14:53,113 INFO L158 Benchmark]: IcfgBuilder took 304.31ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 62.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 13:14:53,113 INFO L158 Benchmark]: TraceAbstraction took 23537.27ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 64.5MB in the end (delta: -2.4MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2025-02-05 13:14:53,113 INFO L158 Benchmark]: Witness Printer took 82.37ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 57.6MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:14:53,114 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.31ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.55ms. Allocated memory is still 117.4MB. Free memory was 93.1MB in the beginning and 81.0MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.25ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.39ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 304.31ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 62.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23537.27ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 64.5MB in the end (delta: -2.4MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * Witness Printer took 82.37ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 57.6MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 82]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 466 mSDsluCounter, 8502 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6937 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3817 IncrementalHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 1565 mSDtfsCounter, 3817 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1915 GetRequests, 1646 SyntacticMatches, 4 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=15, InterpolantAutomatonStates: 225, 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, 28 MinimizatonAttempts, 123 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1782 ConstructedInterpolants, 12 QuantifiedInterpolants, 6008 SizeOfPredicates, 47 NumberOfNonLiveVariables, 3124 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 948/1076 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 25]: Location Invariant Derived location invariant: (\old(x) == x) RESULT: Ultimate proved your program to be correct! [2025-02-05 13:14:53,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE