./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252b.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/double_req_bl_1252b.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 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 13:04:43,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 13:04:43,083 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:04:43,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 13:04:43,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 13:04:43,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 13:04:43,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 13:04:43,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 13:04:43,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 13:04:43,109 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 13:04:43,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 13:04:43,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 13:04:43,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 13:04:43,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 13:04:43,110 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 13:04:43,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 13:04:43,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 13:04:43,110 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 13:04:43,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 13:04:43,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 13:04:43,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 13:04:43,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 13:04:43,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 13:04:43,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 13:04:43,111 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 13:04:43,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 13:04:43,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 13:04:43,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 13:04:43,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 13:04:43,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 13:04:43,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 13:04:43,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 13:04:43,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:04:43,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 13:04:43,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 13:04:43,112 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 13:04:43,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 13:04:43,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 13:04:43,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 13:04:43,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 13:04:43,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 13:04:43,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 13:04:43,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 13:04:43,112 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 -> 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 [2025-02-05 13:04:43,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 13:04:43,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 13:04:43,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 13:04:43,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 13:04:43,351 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 13:04:43,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2025-02-05 13:04:44,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e36ba4640/4fd8003e2f1d473699b5aa7746438086/FLAG8374dbe0a [2025-02-05 13:04:44,780 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 13:04:44,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2025-02-05 13:04:44,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e36ba4640/4fd8003e2f1d473699b5aa7746438086/FLAG8374dbe0a [2025-02-05 13:04:45,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e36ba4640/4fd8003e2f1d473699b5aa7746438086 [2025-02-05 13:04:45,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 13:04:45,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 13:04:45,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 13:04:45,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 13:04:45,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 13:04:45,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c952fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45, skipping insertion in model container [2025-02-05 13:04:45,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 13:04:45,429 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/double_req_bl_1252b.c[2154,2167] [2025-02-05 13:04:45,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:04:45,446 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 13:04:45,476 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/double_req_bl_1252b.c[2154,2167] [2025-02-05 13:04:45,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:04:45,492 INFO L204 MainTranslator]: Completed translation [2025-02-05 13:04:45,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45 WrapperNode [2025-02-05 13:04:45,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 13:04:45,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 13:04:45,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 13:04:45,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 13:04:45,497 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:04:45" (1/1) ... [2025-02-05 13:04:45,501 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:04:45" (1/1) ... [2025-02-05 13:04:45,509 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2025-02-05 13:04:45,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 13:04:45,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 13:04:45,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 13:04:45,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 13:04:45,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,528 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-02-05 13:04:45,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 13:04:45,535 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 13:04:45,535 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 13:04:45,535 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 13:04:45,536 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (1/1) ... [2025-02-05 13:04:45,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:04:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 13:04:45,562 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:04:45,570 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:04:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 13:04:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 13:04:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 13:04:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 13:04:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 13:04:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-02-05 13:04:45,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-02-05 13:04:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-05 13:04:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-05 13:04:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-05 13:04:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 13:04:45,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 13:04:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 13:04:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 13:04:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 13:04:45,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 13:04:45,750 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 13:04:45,755 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 13:04:45,954 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-02-05 13:04:45,954 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 13:04:45,966 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 13:04:45,967 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 13:04:45,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:45 BoogieIcfgContainer [2025-02-05 13:04:45,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 13:04:45,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 13:04:45,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 13:04:45,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 13:04:45,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 01:04:45" (1/3) ... [2025-02-05 13:04:45,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@999ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:04:45, skipping insertion in model container [2025-02-05 13:04:45,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:45" (2/3) ... [2025-02-05 13:04:45,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@999ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:04:45, skipping insertion in model container [2025-02-05 13:04:45,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:45" (3/3) ... [2025-02-05 13:04:45,978 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2025-02-05 13:04:45,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 13:04:45,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1252b.c that has 2 procedures, 35 locations, 1 initial locations, 4 loop locations, and 3 error locations. [2025-02-05 13:04:46,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 13:04:46,062 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;@20500b4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 13:04:46,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-05 13:04:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 13:04:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 13:04:46,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:46,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:46,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [__fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-02-05 13:04:46,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash 616857656, now seen corresponding path program 1 times [2025-02-05 13:04:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 13:04:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110200444] [2025-02-05 13:04:46,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 13:04:46,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 13:04:46,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 13:04:46,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:46,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 13:04:46,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 13:04:46,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 13:04:46,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 13:04:46,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:46,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 13:04:46,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 13:04:46,206 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 13:04:46,207 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 3 remaining) [2025-02-05 13:04:46,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-05 13:04:46,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 3 remaining) [2025-02-05 13:04:46,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 13:04:46,213 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-05 13:04:46,227 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 13:04:46,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 01:04:46 BoogieIcfgContainer [2025-02-05 13:04:46,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 13:04:46,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 13:04:46,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 13:04:46,233 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 13:04:46,234 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:45" (3/4) ... [2025-02-05 13:04:46,236 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 13:04:46,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 13:04:46,237 INFO L158 Benchmark]: Toolchain (without parser) took 1095.57ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 68.4MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 13:04:46,238 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:46,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.53ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 98.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:46,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.45ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 97.4MB in the end (delta: 650.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:46,239 INFO L158 Benchmark]: Boogie Preprocessor took 24.91ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:46,240 INFO L158 Benchmark]: IcfgBuilder took 433.06ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 81.5MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:46,240 INFO L158 Benchmark]: TraceAbstraction took 261.70ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 68.4MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 13:04:46,241 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 142.6MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:46,243 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.19ms. Allocated memory is still 226.5MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.53ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 98.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.45ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 97.4MB in the end (delta: 650.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.91ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 433.06ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 81.5MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 261.70ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 68.4MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 142.6MB. Free memory is still 68.4MB. 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: 29]: 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 29, overapproximation of someUnaryDOUBLEoperation at line 82. Possible FailurePath: [L81] double x = 0.0; [L82] double y = -0.0; [L83] CALL fmax_double(x, y) [L54] CALL __fpclassify_double(x) VAL [\old(x)=0] [L26] __uint32_t msw, lsw; VAL [\old(x)=0] [L33] COND TRUE 0 VAL [\old(x)=0] [L29] ieee_double_shape_type ew_u; VAL [\old(x)=0] - UnprovableResult [Line: 87]: 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: 66]: 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: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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:04:46,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252b.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 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 13:04:48,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 13:04:48,484 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:04:48,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 13:04:48,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 13:04:48,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 13:04:48,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 13:04:48,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 13:04:48,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 13:04:48,514 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 13:04:48,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 13:04:48,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 13:04:48,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 13:04:48,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 13:04:48,515 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 13:04:48,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 13:04:48,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 13:04:48,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 13:04:48,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 13:04:48,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 13:04:48,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 13:04:48,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 13:04:48,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 13:04:48,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 13:04:48,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 13:04:48,516 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 13:04:48,517 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 13:04:48,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 13:04:48,517 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 13:04:48,517 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 13:04:48,517 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 13:04:48,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 13:04:48,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 13:04:48,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 13:04:48,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:04:48,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 13:04:48,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 13:04:48,518 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 13:04:48,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 13:04:48,518 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 13:04:48,518 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 13:04:48,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 13:04:48,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 13:04:48,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 13:04:48,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 13:04:48,519 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 -> 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 [2025-02-05 13:04:48,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 13:04:48,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 13:04:48,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 13:04:48,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 13:04:48,766 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 13:04:48,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2025-02-05 13:04:49,942 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03432085f/0abb8cbc68ec483ba1f82fbbbfdf6159/FLAG1cbeb6e11 [2025-02-05 13:04:50,165 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 13:04:50,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2025-02-05 13:04:50,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03432085f/0abb8cbc68ec483ba1f82fbbbfdf6159/FLAG1cbeb6e11 [2025-02-05 13:04:50,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/03432085f/0abb8cbc68ec483ba1f82fbbbfdf6159 [2025-02-05 13:04:50,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 13:04:50,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 13:04:50,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 13:04:50,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 13:04:50,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 13:04:50,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469f2ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50, skipping insertion in model container [2025-02-05 13:04:50,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 13:04:50,670 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/double_req_bl_1252b.c[2154,2167] [2025-02-05 13:04:50,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:04:50,684 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 13:04:50,703 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/double_req_bl_1252b.c[2154,2167] [2025-02-05 13:04:50,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 13:04:50,723 INFO L204 MainTranslator]: Completed translation [2025-02-05 13:04:50,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50 WrapperNode [2025-02-05 13:04:50,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 13:04:50,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 13:04:50,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 13:04:50,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 13:04:50,730 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:04:50" (1/1) ... [2025-02-05 13:04:50,736 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:04:50" (1/1) ... [2025-02-05 13:04:50,751 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2025-02-05 13:04:50,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 13:04:50,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 13:04:50,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 13:04:50,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 13:04:50,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,775 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-02-05 13:04:50,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 13:04:50,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 13:04:50,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 13:04:50,808 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 13:04:50,809 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (1/1) ... [2025-02-05 13:04:50,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 13:04:50,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 13:04:50,853 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:04:50,859 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:04:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 13:04:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-05 13:04:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-05 13:04:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-05 13:04:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 13:04:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 13:04:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-05 13:04:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 13:04:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-02-05 13:04:50,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-02-05 13:04:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-05 13:04:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-05 13:04:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-05 13:04:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 13:04:50,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 13:04:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 13:04:50,939 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 13:04:50,940 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 13:04:51,054 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-05 13:04:51,055 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 13:04:51,060 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 13:04:51,060 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 13:04:51,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:51 BoogieIcfgContainer [2025-02-05 13:04:51,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 13:04:51,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 13:04:51,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 13:04:51,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 13:04:51,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 01:04:50" (1/3) ... [2025-02-05 13:04:51,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6acd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:04:51, skipping insertion in model container [2025-02-05 13:04:51,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 01:04:50" (2/3) ... [2025-02-05 13:04:51,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6acd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 01:04:51, skipping insertion in model container [2025-02-05 13:04:51,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:51" (3/3) ... [2025-02-05 13:04:51,068 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2025-02-05 13:04:51,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 13:04:51,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1252b.c that has 2 procedures, 27 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 13:04:51,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 13:04:51,121 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;@40a94a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 13:04:51,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 13:04:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 13:04:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 13:04:51,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:51,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:51,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:51,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2062203858, now seen corresponding path program 1 times [2025-02-05 13:04:51,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:51,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087432] [2025-02-05 13:04:51,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:51,138 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:04:51,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:51,140 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:04:51,142 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:04:51,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 13:04:51,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 13:04:51,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:51,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:51,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 13:04:51,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:51,244 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:04:51,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:51,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:51,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087432] [2025-02-05 13:04:51,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:51,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:51,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 13:04:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754312276] [2025-02-05 13:04:51,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:51,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 13:04:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:51,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 13:04:51,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 13:04:51,267 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:51,280 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2025-02-05 13:04:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 13:04:51,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-05 13:04:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:51,284 INFO L225 Difference]: With dead ends: 51 [2025-02-05 13:04:51,284 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 13:04:51,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:04:51,289 INFO L435 NwaCegarLoop]: 34 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, 34 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:04:51,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 13:04:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-05 13:04:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 13:04:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-02-05 13:04:51,309 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2025-02-05 13:04:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:51,310 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-02-05 13:04:51,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-02-05 13:04:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 13:04:51,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:51,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:51,314 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:04:51,513 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:04:51,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:51,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1219521436, now seen corresponding path program 1 times [2025-02-05 13:04:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:51,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594473995] [2025-02-05 13:04:51,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:51,515 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:04:51,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:51,518 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:04:51,520 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:04:51,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 13:04:51,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 13:04:51,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:51,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:51,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:51,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:51,672 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:04:51,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:51,676 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:51,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594473995] [2025-02-05 13:04:51,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594473995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:51,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:51,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:51,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482651316] [2025-02-05 13:04:51,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:51,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:51,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:51,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:51,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:51,678 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:51,758 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-02-05 13:04:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:51,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-05 13:04:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:51,760 INFO L225 Difference]: With dead ends: 36 [2025-02-05 13:04:51,761 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 13:04:51,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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:04:51,762 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:51,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 13:04:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 13:04:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-05 13:04:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 13:04:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-02-05 13:04:51,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2025-02-05 13:04:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:51,773 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-02-05 13:04:51,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-02-05 13:04:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 13:04:51,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:51,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:51,779 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 (3)] Ended with exit code 0 [2025-02-05 13:04:51,978 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:04:51,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:51,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:51,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1732408590, now seen corresponding path program 1 times [2025-02-05 13:04:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563949452] [2025-02-05 13:04:51,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:51,983 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:04:51,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:51,985 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:04:52,010 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:04:52,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 13:04:52,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 13:04:52,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:52,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:52,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 13:04:52,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:52,368 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:04:52,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:52,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:52,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563949452] [2025-02-05 13:04:52,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563949452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:52,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:52,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 13:04:52,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075632602] [2025-02-05 13:04:52,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:52,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 13:04:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:52,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 13:04:52,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 13:04:52,370 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:52,619 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2025-02-05 13:04:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 13:04:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-05 13:04:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:52,621 INFO L225 Difference]: With dead ends: 53 [2025-02-05 13:04:52,621 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 13:04:52,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 13:04:52,622 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:52,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 13:04:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 13:04:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-02-05 13:04:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 13:04:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-02-05 13:04:52,627 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2025-02-05 13:04:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:52,627 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-02-05 13:04:52,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-02-05 13:04:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 13:04:52,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:52,628 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:04:52,635 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 (4)] Forceful destruction successful, exit code 0 [2025-02-05 13:04:52,828 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:04:52,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:52,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1514793145, now seen corresponding path program 1 times [2025-02-05 13:04:52,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:52,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706519852] [2025-02-05 13:04:52,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:52,833 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:04:52,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:52,836 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:04:52,837 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:04:52,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 13:04:52,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 13:04:52,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:52,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:52,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:52,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:52,912 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:04:52,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:52,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706519852] [2025-02-05 13:04:52,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706519852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:52,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:52,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:52,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263338694] [2025-02-05 13:04:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:52,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:52,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:52,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:52,913 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:53,170 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2025-02-05 13:04:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:53,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:04:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:53,172 INFO L225 Difference]: With dead ends: 41 [2025-02-05 13:04:53,172 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 13:04:53,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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:04:53,173 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 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.2s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:53,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 13:04:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 13:04:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-02-05 13:04:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 13:04:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-02-05 13:04:53,178 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2025-02-05 13:04:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:53,178 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-02-05 13:04:53,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-02-05 13:04:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 13:04:53,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:53,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:53,186 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:04:53,379 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:04:53,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:53,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash 126433611, now seen corresponding path program 1 times [2025-02-05 13:04:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101291571] [2025-02-05 13:04:53,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:53,383 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:04:53,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:53,385 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:04:53,388 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:04:53,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 13:04:53,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 13:04:53,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:53,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:53,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 13:04:53,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:53,564 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:04:53,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:53,564 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101291571] [2025-02-05 13:04:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101291571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:53,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 13:04:53,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081775608] [2025-02-05 13:04:53,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:53,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 13:04:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:53,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 13:04:53,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 13:04:53,566 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:53,745 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-02-05 13:04:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 13:04:53,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-05 13:04:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:53,746 INFO L225 Difference]: With dead ends: 53 [2025-02-05 13:04:53,746 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 13:04:53,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 13:04:53,747 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:53,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 13:04:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 13:04:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-05 13:04:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:04:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-02-05 13:04:53,751 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2025-02-05 13:04:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:53,751 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-02-05 13:04:53,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 13:04:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-02-05 13:04:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 13:04:53,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:53,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:53,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 (6)] Ended with exit code 0 [2025-02-05 13:04:53,955 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:04:53,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:53,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1881886182, now seen corresponding path program 1 times [2025-02-05 13:04:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:53,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165490560] [2025-02-05 13:04:53,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:53,957 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:04:53,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:53,959 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:04:53,960 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:04:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 13:04:54,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 13:04:54,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:54,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:54,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:54,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 13:04:54,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:54,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165490560] [2025-02-05 13:04:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165490560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:54,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:54,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047587517] [2025-02-05 13:04:54,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:54,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:54,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:54,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:54,061 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:54,100 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-02-05 13:04:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:54,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-05 13:04:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:54,105 INFO L225 Difference]: With dead ends: 38 [2025-02-05 13:04:54,105 INFO L226 Difference]: Without dead ends: 29 [2025-02-05 13:04:54,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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:04:54,105 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 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:04:54,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-05 13:04:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-05 13:04:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 13:04:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-02-05 13:04:54,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 22 [2025-02-05 13:04:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:54,112 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-02-05 13:04:54,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-02-05 13:04:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 13:04:54,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:54,112 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:54,116 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:04:54,313 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:04:54,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:54,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1880039140, now seen corresponding path program 1 times [2025-02-05 13:04:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:54,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236474351] [2025-02-05 13:04:54,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:54,314 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:04:54,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:54,316 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:04:54,317 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:04:54,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 13:04:54,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 13:04:54,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:54,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:54,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 13:04:54,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 13:04:54,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:54,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236474351] [2025-02-05 13:04:54,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236474351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:54,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:54,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 13:04:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368429242] [2025-02-05 13:04:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:54,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 13:04:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:54,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 13:04:54,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 13:04:54,437 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:54,472 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-02-05 13:04:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 13:04:54,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-05 13:04:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:54,473 INFO L225 Difference]: With dead ends: 34 [2025-02-05 13:04:54,473 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 13:04:54,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 13:04:54,473 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:54,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 13:04:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-05 13:04:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 13:04:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-02-05 13:04:54,478 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2025-02-05 13:04:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:54,478 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-02-05 13:04:54,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-02-05 13:04:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 13:04:54,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:54,479 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:54,483 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 (8)] Forceful destruction successful, exit code 0 [2025-02-05 13:04:54,679 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:04:54,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:54,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1934330154, now seen corresponding path program 1 times [2025-02-05 13:04:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735982148] [2025-02-05 13:04:54,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:54,681 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:04:54,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:54,684 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:04:54,685 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:04:54,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 13:04:54,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 13:04:54,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:54,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:54,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 13:04:54,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 13:04:54,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:54,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735982148] [2025-02-05 13:04:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735982148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:54,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:54,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 13:04:54,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109388527] [2025-02-05 13:04:54,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:54,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 13:04:54,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:54,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 13:04:54,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 13:04:54,850 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:55,009 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-02-05 13:04:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 13:04:55,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-05 13:04:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:55,010 INFO L225 Difference]: With dead ends: 45 [2025-02-05 13:04:55,010 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 13:04:55,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 13:04:55,011 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:55,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 13:04:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 13:04:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-05 13:04:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 13:04:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-02-05 13:04:55,014 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 23 [2025-02-05 13:04:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:55,014 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-02-05 13:04:55,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-02-05 13:04:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 13:04:55,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:55,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:55,018 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:04:55,218 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:04:55,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:55,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1040704247, now seen corresponding path program 1 times [2025-02-05 13:04:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:55,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786804638] [2025-02-05 13:04:55,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:55,219 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:04:55,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:55,221 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:04:55,224 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:04:55,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 13:04:55,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 13:04:55,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:55,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:55,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 13:04:55,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 13:04:55,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:55,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786804638] [2025-02-05 13:04:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786804638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:55,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:55,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 13:04:55,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097564985] [2025-02-05 13:04:55,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:55,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 13:04:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:55,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 13:04:55,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 13:04:55,282 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:55,298 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-02-05 13:04:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 13:04:55,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-05 13:04:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:55,299 INFO L225 Difference]: With dead ends: 41 [2025-02-05 13:04:55,299 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 13:04:55,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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:04:55,300 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 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:04:55,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 13:04:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 13:04:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-02-05 13:04:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 13:04:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-05 13:04:55,302 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 24 [2025-02-05 13:04:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:55,303 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-05 13:04:55,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-02-05 13:04:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 13:04:55,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:55,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:55,309 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:04:55,506 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:04:55,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:55,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash 170856871, now seen corresponding path program 1 times [2025-02-05 13:04:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:55,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099383657] [2025-02-05 13:04:55,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:55,507 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:04:55,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:55,509 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:04:55,510 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:04:55,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 13:04:55,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 13:04:55,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:55,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 13:04:55,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 13:04:55,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 13:04:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 13:04:55,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 13:04:55,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 13:04:55,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099383657] [2025-02-05 13:04:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099383657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 13:04:55,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 13:04:55,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 13:04:55,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133161005] [2025-02-05 13:04:55,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 13:04:55,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 13:04:55,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 13:04:55,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 13:04:55,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 13:04:55,669 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 13:04:56,320 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-02-05 13:04:56,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 13:04:56,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-02-05 13:04:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 13:04:56,321 INFO L225 Difference]: With dead ends: 38 [2025-02-05 13:04:56,321 INFO L226 Difference]: Without dead ends: 23 [2025-02-05 13:04:56,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 13:04:56,322 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 13:04:56,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 13:04:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-05 13:04:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-05 13:04:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 13:04:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-02-05 13:04:56,324 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 25 [2025-02-05 13:04:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 13:04:56,324 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-02-05 13:04:56,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 13:04:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-02-05 13:04:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 13:04:56,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 13:04:56,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:56,328 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 (11)] Ended with exit code 0 [2025-02-05 13:04:56,527 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:04:56,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 13:04:56,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 13:04:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1432350456, now seen corresponding path program 1 times [2025-02-05 13:04:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 13:04:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014877536] [2025-02-05 13:04:56,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 13:04:56,528 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:04:56,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 13:04:56,531 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:04:56,532 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:04:56,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 13:04:56,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 13:04:56,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:56,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 13:04:56,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 13:04:56,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 13:04:56,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 13:04:56,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 13:04:56,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 13:04:56,662 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-05 13:04:56,662 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 13:04:56,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 13:04:56,669 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:04:56,868 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:04:56,871 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 13:04:56,893 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 13:04:56,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 01:04:56 BoogieIcfgContainer [2025-02-05 13:04:56,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 13:04:56,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 13:04:56,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 13:04:56,897 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 13:04:56,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 01:04:51" (3/4) ... [2025-02-05 13:04:56,898 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 13:04:56,938 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 20. [2025-02-05 13:04:56,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 13:04:56,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 13:04:56,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 13:04:56,983 INFO L158 Benchmark]: Toolchain (without parser) took 6458.21ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 59.0MB in the end (delta: 33.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2025-02-05 13:04:56,983 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:56,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.35ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.8MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:56,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.94ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:56,984 INFO L158 Benchmark]: Boogie Preprocessor took 49.74ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:56,985 INFO L158 Benchmark]: IcfgBuilder took 257.43ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 63.1MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:56,985 INFO L158 Benchmark]: TraceAbstraction took 5833.85ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 65.9MB in the end (delta: -3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 13:04:56,985 INFO L158 Benchmark]: Witness Printer took 85.61ms. Allocated memory is still 117.4MB. Free memory was 65.9MB in the beginning and 59.0MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 13:04:56,987 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.16ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.35ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.8MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.94ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.74ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 257.43ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 63.1MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5833.85ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 65.9MB in the end (delta: -3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 85.61ms. Allocated memory is still 117.4MB. Free memory was 65.9MB in the beginning and 59.0MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L81] double x = 0.0; [L82] double y = -0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L26] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L33] COND TRUE 0 [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L33] COND FALSE !(0) VAL [\old(x)=0.0, lsw=0, msw=0, x=0.0] [L35-L36] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L37] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L54] RET, EXPR __fpclassify_double(x) VAL [x=0.0, y=0.0] [L54] COND FALSE !(__fpclassify_double(x) == 0) [L56] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L26] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L33] COND TRUE 0 [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L33] COND FALSE !(0) VAL [\old(x)=0.0, lsw=0, msw=-2147483648, x=0.0] [L35-L36] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L37] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L56] RET, EXPR __fpclassify_double(y) VAL [x=0.0, y=0.0] [L56] COND FALSE !(__fpclassify_double(y) == 0) [L59] return x > y ? x : y; VAL [\result=0.0] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0.0] [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] CALL, EXPR __signbit_double(res) [L63] __uint32_t msw; VAL [x=0.0] [L69] COND TRUE 0 [L66] ieee_double_shape_type gh_u; [L67] gh_u.value = (x) [L68] EXPR gh_u.parts.msw [L68] (msw) = gh_u.parts.msw [L69] COND FALSE !(0) VAL [msw=-2147483648, x=0.0] [L71] return (msw & 0x80000000) != 0; VAL [\result=1, x=0.0] [L86] RET, EXPR __signbit_double(res) [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 766 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 507 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 259 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, InterpolantAutomatonStates: 49, 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 181 ConstructedInterpolants, 24 QuantifiedInterpolants, 755 SizeOfPredicates, 15 NumberOfNonLiveVariables, 680 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 30/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 13:04:57,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE