./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1250.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1250.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 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 01:12:58,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 01:12:58,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 01:12:58,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 01:12:58,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 01:12:58,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 01:12:58,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 01:12:58,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 01:12:58,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 01:12:58,282 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 01:12:58,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 01:12:58,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 01:12:58,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 01:12:58,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 01:12:58,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 01:12:58,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:12:58,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:12:58,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 01:12:58,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 01:12:58,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 01:12:58,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 01:12:58,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 01:12:58,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 01:12:58,285 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2025-01-09 01:12:58,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 01:12:58,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 01:12:58,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 01:12:58,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 01:12:58,490 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 01:12:58,491 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_1250.c [2025-01-09 01:12:59,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f88d71a08/aa3082c58e274021a8feb59c7326998a/FLAG2e6064fff [2025-01-09 01:12:59,832 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 01:12:59,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2025-01-09 01:12:59,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f88d71a08/aa3082c58e274021a8feb59c7326998a/FLAG2e6064fff [2025-01-09 01:12:59,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f88d71a08/aa3082c58e274021a8feb59c7326998a [2025-01-09 01:12:59,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 01:12:59,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 01:12:59,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 01:12:59,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 01:12:59,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 01:12:59,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:12:59" (1/1) ... [2025-01-09 01:12:59,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1024d8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:12:59, skipping insertion in model container [2025-01-09 01:12:59,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:12:59" (1/1) ... [2025-01-09 01:12:59,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 01:13:00,025 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_1250.c[1965,1978] [2025-01-09 01:13:00,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 01:13:00,042 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 01:13:00,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c[1965,1978] [2025-01-09 01:13:00,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 01:13:00,066 INFO L204 MainTranslator]: Completed translation [2025-01-09 01:13:00,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00 WrapperNode [2025-01-09 01:13:00,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 01:13:00,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 01:13:00,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 01:13:00,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 01:13:00,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,093 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2025-01-09 01:13:00,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 01:13:00,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 01:13:00,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 01:13:00,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 01:13:00,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,115 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 01:13:00,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 01:13:00,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 01:13:00,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 01:13:00,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 01:13:00,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (1/1) ... [2025-01-09 01:13:00,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:13:00,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 01:13:00,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 01:13:00,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 01:13:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 01:13:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 01:13:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 01:13:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 01:13:00,175 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-01-09 01:13:00,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-01-09 01:13:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 01:13:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 01:13:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 01:13:00,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 01:13:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 01:13:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 01:13:00,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 01:13:00,238 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 01:13:00,239 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 01:13:00,380 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 01:13:00,380 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 01:13:00,389 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 01:13:00,390 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 01:13:00,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:13:00 BoogieIcfgContainer [2025-01-09 01:13:00,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 01:13:00,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 01:13:00,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 01:13:00,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 01:13:00,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:12:59" (1/3) ... [2025-01-09 01:13:00,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1af682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:13:00, skipping insertion in model container [2025-01-09 01:13:00,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:00" (2/3) ... [2025-01-09 01:13:00,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1af682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:13:00, skipping insertion in model container [2025-01-09 01:13:00,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:13:00" (3/3) ... [2025-01-09 01:13:00,399 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2025-01-09 01:13:00,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 01:13:00,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1250.c that has 2 procedures, 27 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 01:13:00,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 01:13:00,460 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;@6ee1e255, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 01:13:00,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 01:13:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 23 states have internal predecessors, (33), 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-01-09 01:13:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 01:13:00,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:00,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 01:13:00,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [__fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:00,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:00,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1984825506, now seen corresponding path program 1 times [2025-01-09 01:13:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 01:13:00,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278448710] [2025-01-09 01:13:00,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:00,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 01:13:00,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 01:13:00,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 01:13:00,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:00,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 01:13:00,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 01:13:00,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 01:13:00,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 01:13:00,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:00,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 01:13:00,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 01:13:00,588 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 01:13:00,590 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (1 of 2 remaining) [2025-01-09 01:13:00,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-09 01:13:00,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 01:13:00,596 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 01:13:00,608 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 01:13:00,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:13:00 BoogieIcfgContainer [2025-01-09 01:13:00,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 01:13:00,613 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 01:13:00,613 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 01:13:00,613 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 01:13:00,614 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:13:00" (3/4) ... [2025-01-09 01:13:00,615 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 01:13:00,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 01:13:00,617 INFO L158 Benchmark]: Toolchain (without parser) took 728.20ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 66.0MB in the end (delta: 39.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 01:13:00,617 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:13:00,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.14ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:13:00,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.40ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.1MB in the end (delta: 945.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:13:00,619 INFO L158 Benchmark]: Boogie Preprocessor took 38.69ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:13:00,620 INFO L158 Benchmark]: RCFGBuilder took 258.43ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 79.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:13:00,620 INFO L158 Benchmark]: TraceAbstraction took 218.99ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 66.0MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 01:13:00,621 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 142.6MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:13:00,622 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 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.14ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.40ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 93.1MB in the end (delta: 945.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.69ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 258.43ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 79.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 218.99ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 66.0MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 142.6MB. Free memory is still 66.0MB. 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: 32]: 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 someBinaryArithmeticDOUBLEoperation at line 69, overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 32. Possible FailurePath: [L69] double x = 0.0 / 0.0; [L70] double y = 0.0 / 0.0; [L71] CALL fmax_double(x, y) [L57] CALL __fpclassify_double(x) VAL [\old(x)=55] [L29] __uint32_t msw, lsw; VAL [\old(x)=55] [L32] ieee_double_shape_type ew_u; VAL [\old(x)=55] - UnprovableResult [Line: 74]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 2 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=27occurred 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, 6 NumberOfCodeBlocks, 6 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-01-09 01:13:00,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1250.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 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 01:13:02,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 01:13:02,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 01:13:02,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 01:13:02,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 01:13:02,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 01:13:02,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 01:13:02,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 01:13:02,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 01:13:02,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 01:13:02,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 01:13:02,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 01:13:02,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 01:13:02,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:13:02,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 01:13:02,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 01:13:02,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 01:13:02,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:13:02,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 01:13:02,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 01:13:02,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 01:13:02,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 01:13:02,840 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 01:13:02,840 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 01:13:02,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 01:13:02,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 01:13:02,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 01:13:02,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 01:13:02,840 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2025-01-09 01:13:03,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 01:13:03,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 01:13:03,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 01:13:03,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 01:13:03,108 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 01:13:03,109 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_1250.c [2025-01-09 01:13:04,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e49df63c/31d6fcfbebf44dc29fa1b0bd3f24c5b0/FLAG59e0de828 [2025-01-09 01:13:04,493 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 01:13:04,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2025-01-09 01:13:04,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e49df63c/31d6fcfbebf44dc29fa1b0bd3f24c5b0/FLAG59e0de828 [2025-01-09 01:13:04,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e49df63c/31d6fcfbebf44dc29fa1b0bd3f24c5b0 [2025-01-09 01:13:04,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 01:13:04,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 01:13:04,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 01:13:04,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 01:13:04,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 01:13:04,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf4c667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04, skipping insertion in model container [2025-01-09 01:13:04,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 01:13:04,651 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_1250.c[1965,1978] [2025-01-09 01:13:04,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 01:13:04,665 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 01:13:04,685 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_1250.c[1965,1978] [2025-01-09 01:13:04,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 01:13:04,702 INFO L204 MainTranslator]: Completed translation [2025-01-09 01:13:04,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04 WrapperNode [2025-01-09 01:13:04,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 01:13:04,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 01:13:04,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 01:13:04,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 01:13:04,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,734 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2025-01-09 01:13:04,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 01:13:04,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 01:13:04,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 01:13:04,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 01:13:04,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,759 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 01:13:04,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 01:13:04,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 01:13:04,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 01:13:04,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 01:13:04,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (1/1) ... [2025-01-09 01:13:04,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 01:13:04,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 01:13:04,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 01:13:04,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 01:13:04,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 01:13:04,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 01:13:04,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 01:13:04,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 01:13:04,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 01:13:04,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 01:13:04,835 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-01-09 01:13:04,835 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-01-09 01:13:04,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 01:13:04,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 01:13:04,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 01:13:04,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 01:13:04,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 01:13:04,889 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 01:13:04,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 01:13:05,026 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 01:13:05,026 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 01:13:05,034 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 01:13:05,035 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 01:13:05,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:13:05 BoogieIcfgContainer [2025-01-09 01:13:05,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 01:13:05,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 01:13:05,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 01:13:05,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 01:13:05,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:13:04" (1/3) ... [2025-01-09 01:13:05,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bdecb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:13:05, skipping insertion in model container [2025-01-09 01:13:05,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:13:04" (2/3) ... [2025-01-09 01:13:05,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bdecb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:13:05, skipping insertion in model container [2025-01-09 01:13:05,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:13:05" (3/3) ... [2025-01-09 01:13:05,047 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2025-01-09 01:13:05,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 01:13:05,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1250.c that has 2 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 01:13:05,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 01:13:05,109 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;@39162999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 01:13:05,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 01:13:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-01-09 01:13:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 01:13:05,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:05,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:13:05,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:05,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1246372674, now seen corresponding path program 1 times [2025-01-09 01:13:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827814247] [2025-01-09 01:13:05,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:05,136 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-01-09 01:13:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:05,144 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-01-09 01:13:05,145 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-01-09 01:13:05,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 01:13:05,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 01:13:05,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:05,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:05,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 01:13:05,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:13:05,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:05,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827814247] [2025-01-09 01:13:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827814247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:05,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:05,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 01:13:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910022418] [2025-01-09 01:13:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:05,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 01:13:05,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:05,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 01:13:05,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 01:13:05,271 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-01-09 01:13:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:05,286 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2025-01-09 01:13:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 01:13:05,287 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-01-09 01:13:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:05,292 INFO L225 Difference]: With dead ends: 43 [2025-01-09 01:13:05,292 INFO L226 Difference]: Without dead ends: 20 [2025-01-09 01:13:05,294 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-01-09 01:13:05,297 INFO L435 NwaCegarLoop]: 29 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, 29 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-01-09 01:13:05,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:13:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-09 01:13:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-09 01:13:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-01-09 01:13:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-01-09 01:13:05,326 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 13 [2025-01-09 01:13:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:05,327 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-01-09 01:13:05,327 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-01-09 01:13:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-01-09 01:13:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 01:13:05,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:05,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:13:05,333 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-01-09 01:13:05,533 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-01-09 01:13:05,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:05,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1661990885, now seen corresponding path program 1 times [2025-01-09 01:13:05,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:05,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066954033] [2025-01-09 01:13:05,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:05,537 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-01-09 01:13:05,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:05,539 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-01-09 01:13:05,542 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-01-09 01:13:05,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 01:13:05,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 01:13:05,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:05,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:05,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:13:05,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:13:05,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:05,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:05,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066954033] [2025-01-09 01:13:05,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066954033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:05,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:05,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:13:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195973366] [2025-01-09 01:13:05,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:05,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:13:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:05,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:13:05,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:13:05,705 INFO L87 Difference]: Start difference. First operand 20 states and 26 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-01-09 01:13:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:05,725 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2025-01-09 01:13:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:13:05,725 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-01-09 01:13:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:05,727 INFO L225 Difference]: With dead ends: 28 [2025-01-09 01:13:05,727 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 01:13:05,727 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-01-09 01:13:05,728 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-01-09 01:13:05,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:13:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 01:13:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-09 01:13:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-01-09 01:13:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-01-09 01:13:05,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 14 [2025-01-09 01:13:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:05,742 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-01-09 01:13:05,742 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-01-09 01:13:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-01-09 01:13:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 01:13:05,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:05,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:13:05,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 01:13:05,943 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-01-09 01:13:05,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:05,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1156380186, now seen corresponding path program 1 times [2025-01-09 01:13:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:05,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453715072] [2025-01-09 01:13:05,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:05,944 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-01-09 01:13:05,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:05,949 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-01-09 01:13:05,950 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-01-09 01:13:05,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 01:13:06,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 01:13:06,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:06,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:06,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:13:06,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:13:06,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:06,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453715072] [2025-01-09 01:13:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453715072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:06,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:13:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720753731] [2025-01-09 01:13:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:06,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:13:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:06,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:13:06,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:13:06,031 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-01-09 01:13:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:06,221 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-01-09 01:13:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:13:06,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-01-09 01:13:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:06,222 INFO L225 Difference]: With dead ends: 31 [2025-01-09 01:13:06,222 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 01:13:06,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-01-09 01:13:06,223 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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-01-09 01:13:06,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 01:13:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 01:13:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-01-09 01:13:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-01-09 01:13:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-01-09 01:13:06,227 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2025-01-09 01:13:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:06,227 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-01-09 01:13:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-01-09 01:13:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-01-09 01:13:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 01:13:06,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:06,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:13:06,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 01:13:06,428 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-01-09 01:13:06,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:06,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1043624449, now seen corresponding path program 1 times [2025-01-09 01:13:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519554333] [2025-01-09 01:13:06,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:06,430 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-01-09 01:13:06,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:06,433 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-01-09 01:13:06,434 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-01-09 01:13:06,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 01:13:06,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 01:13:06,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:06,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:06,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:13:06,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:13:06,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:06,516 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519554333] [2025-01-09 01:13:06,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519554333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:06,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:06,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:13:06,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109012742] [2025-01-09 01:13:06,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:06,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:13:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:06,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:13:06,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:13:06,518 INFO L87 Difference]: Start difference. First operand 23 states and 30 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-01-09 01:13:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:06,612 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-01-09 01:13:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:13:06,613 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-01-09 01:13:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:06,613 INFO L225 Difference]: With dead ends: 31 [2025-01-09 01:13:06,613 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 01:13:06,614 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-01-09 01:13:06,617 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 01:13:06,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 01:13:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 01:13:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-01-09 01:13:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-01-09 01:13:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-01-09 01:13:06,622 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2025-01-09 01:13:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:06,622 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-01-09 01:13:06,623 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-01-09 01:13:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-01-09 01:13:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 01:13:06,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:06,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:13:06,627 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 (5)] Forceful destruction successful, exit code 0 [2025-01-09 01:13:06,823 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-01-09 01:13:06,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:06,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash 224470646, now seen corresponding path program 1 times [2025-01-09 01:13:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:06,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889428863] [2025-01-09 01:13:06,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:06,825 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-01-09 01:13:06,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:06,827 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-01-09 01:13:06,829 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-01-09 01:13:06,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 01:13:06,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 01:13:06,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:06,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:06,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:13:06,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:13:06,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:06,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:06,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889428863] [2025-01-09 01:13:06,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889428863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:06,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:06,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:13:06,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581342499] [2025-01-09 01:13:06,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:06,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:13:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:06,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:13:06,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:13:06,912 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 01:13:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:07,077 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-01-09 01:13:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:13:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-09 01:13:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:07,078 INFO L225 Difference]: With dead ends: 31 [2025-01-09 01:13:07,078 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 01:13:07,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-01-09 01:13:07,079 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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-01-09 01:13:07,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 01:13:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 01:13:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-01-09 01:13:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-01-09 01:13:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-01-09 01:13:07,083 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 17 [2025-01-09 01:13:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-01-09 01:13:07,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 01:13:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-01-09 01:13:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 01:13:07,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:07,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:13:07,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-01-09 01:13:07,284 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-01-09 01:13:07,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:07,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:07,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1967280981, now seen corresponding path program 1 times [2025-01-09 01:13:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:07,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585573527] [2025-01-09 01:13:07,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:07,286 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-01-09 01:13:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:07,289 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-01-09 01:13:07,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 01:13:07,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 01:13:07,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 01:13:07,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:07,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:07,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 01:13:07,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 01:13:07,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:07,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585573527] [2025-01-09 01:13:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585573527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:07,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:07,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 01:13:07,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250588884] [2025-01-09 01:13:07,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:07,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 01:13:07,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:07,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 01:13:07,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 01:13:07,445 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.5) 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-01-09 01:13:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:07,509 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-01-09 01:13:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 01:13:07,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) 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-01-09 01:13:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:07,510 INFO L225 Difference]: With dead ends: 28 [2025-01-09 01:13:07,510 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 01:13:07,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 01:13:07,511 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 01:13:07,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 01:13:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 01:13:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-01-09 01:13:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 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-01-09 01:13:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-01-09 01:13:07,513 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2025-01-09 01:13:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:07,513 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-01-09 01:13:07,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) 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-01-09 01:13:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-01-09 01:13:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 01:13:07,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:07,514 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:13:07,518 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-01-09 01:13:07,714 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-01-09 01:13:07,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:07,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash 847486152, now seen corresponding path program 1 times [2025-01-09 01:13:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:07,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856619192] [2025-01-09 01:13:07,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:07,716 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-01-09 01:13:07,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:07,719 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-01-09 01:13:07,721 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-01-09 01:13:07,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 01:13:07,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 01:13:07,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:07,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:07,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:13:07,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 01:13:07,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:07,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:07,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856619192] [2025-01-09 01:13:07,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856619192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:07,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:07,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:13:07,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074227669] [2025-01-09 01:13:07,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:07,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:13:07,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:07,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:13:07,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:13:07,841 INFO L87 Difference]: Start difference. First operand 20 states and 24 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-01-09 01:13:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:07,896 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-01-09 01:13:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:13:07,897 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-01-09 01:13:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:07,897 INFO L225 Difference]: With dead ends: 28 [2025-01-09 01:13:07,897 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 01:13:07,898 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-01-09 01:13:07,898 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 01:13:07,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 01:13:07,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 01:13:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 01:13:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-01-09 01:13:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-01-09 01:13:07,901 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 22 [2025-01-09 01:13:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:07,901 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-09 01:13:07,901 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-01-09 01:13:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-01-09 01:13:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 01:13:07,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:07,902 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-01-09 01:13:07,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 01:13:08,102 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-01-09 01:13:08,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:08,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -207445601, now seen corresponding path program 1 times [2025-01-09 01:13:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:08,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670049735] [2025-01-09 01:13:08,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:08,104 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-01-09 01:13:08,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:08,107 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-01-09 01:13:08,108 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-01-09 01:13:08,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 01:13:08,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 01:13:08,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:08,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:08,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:13:08,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 01:13:08,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:08,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:08,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670049735] [2025-01-09 01:13:08,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670049735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:08,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:08,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:13:08,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170091604] [2025-01-09 01:13:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:08,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:13:08,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:08,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:13:08,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:13:08,236 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-01-09 01:13:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:08,251 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-01-09 01:13:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:13:08,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-01-09 01:13:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:08,252 INFO L225 Difference]: With dead ends: 30 [2025-01-09 01:13:08,252 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 01:13:08,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-01-09 01:13:08,252 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:13:08,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:13:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 01:13:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-01-09 01:13:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-01-09 01:13:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-01-09 01:13:08,255 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 23 [2025-01-09 01:13:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:08,255 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-09 01:13:08,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-01-09 01:13:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-01-09 01:13:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 01:13:08,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:08,256 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-01-09 01:13:08,261 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-01-09 01:13:08,460 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-01-09 01:13:08,460 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:08,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash -169284828, now seen corresponding path program 1 times [2025-01-09 01:13:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:08,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992156212] [2025-01-09 01:13:08,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:08,461 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-01-09 01:13:08,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:08,464 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-01-09 01:13:08,465 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-01-09 01:13:08,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 01:13:08,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 01:13:08,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:08,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:08,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:13:08,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 01:13:08,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:08,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:08,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992156212] [2025-01-09 01:13:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992156212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:08,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:08,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:13:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524064949] [2025-01-09 01:13:08,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:08,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:13:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:08,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:13:08,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:13:08,554 INFO L87 Difference]: Start difference. First operand 22 states and 26 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-01-09 01:13:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:08,570 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-01-09 01:13:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:13:08,571 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-01-09 01:13:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:08,572 INFO L225 Difference]: With dead ends: 30 [2025-01-09 01:13:08,573 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 01:13:08,573 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-01-09 01:13:08,574 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:13:08,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:13:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 01:13:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-01-09 01:13:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-01-09 01:13:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-01-09 01:13:08,576 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2025-01-09 01:13:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:08,578 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-09 01:13:08,578 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-01-09 01:13:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-01-09 01:13:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 01:13:08,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:08,579 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-01-09 01:13:08,585 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-01-09 01:13:08,781 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-01-09 01:13:08,781 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:08,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash -604994117, now seen corresponding path program 1 times [2025-01-09 01:13:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:08,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111842337] [2025-01-09 01:13:08,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:08,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 01:13:08,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:08,787 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-01-09 01:13:08,792 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-01-09 01:13:08,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 01:13:08,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 01:13:08,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:08,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:08,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 01:13:08,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 01:13:08,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:08,883 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111842337] [2025-01-09 01:13:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111842337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 01:13:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698321107] [2025-01-09 01:13:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:08,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 01:13:08,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:08,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 01:13:08,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 01:13:08,884 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-01-09 01:13:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:08,944 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-01-09 01:13:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 01:13:08,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-01-09 01:13:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:08,945 INFO L225 Difference]: With dead ends: 30 [2025-01-09 01:13:08,945 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 01:13:08,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-01-09 01:13:08,945 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 01:13:08,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 01:13:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 01:13:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-01-09 01:13:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-01-09 01:13:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-01-09 01:13:08,948 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 25 [2025-01-09 01:13:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:08,948 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-09 01:13:08,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-01-09 01:13:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-01-09 01:13:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 01:13:08,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 01:13:08,949 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-01-09 01:13:08,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2025-01-09 01:13:09,153 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-01-09 01:13:09,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 01:13:09,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 01:13:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1137816218, now seen corresponding path program 1 times [2025-01-09 01:13:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 01:13:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840197820] [2025-01-09 01:13:09,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 01:13:09,154 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-01-09 01:13:09,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 01:13:09,157 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-01-09 01:13:09,157 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-01-09 01:13:09,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 01:13:09,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 01:13:09,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 01:13:09,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 01:13:09,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 01:13:09,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 01:13:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 01:13:09,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 01:13:09,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 01:13:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840197820] [2025-01-09 01:13:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840197820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 01:13:09,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 01:13:09,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 01:13:09,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136758485] [2025-01-09 01:13:09,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 01:13:09,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 01:13:09,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 01:13:09,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 01:13:09,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 01:13:09,333 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-01-09 01:13:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 01:13:09,373 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-01-09 01:13:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 01:13:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 25 [2025-01-09 01:13:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 01:13:09,374 INFO L225 Difference]: With dead ends: 22 [2025-01-09 01:13:09,374 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 01:13:09,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 01:13:09,375 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 01:13:09,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 01:13:09,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 01:13:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 01:13:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 01:13:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 01:13:09,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2025-01-09 01:13:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 01:13:09,375 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 01:13:09,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-01-09 01:13:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 01:13:09,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 01:13:09,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 01:13:09,382 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-01-09 01:13:09,582 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-01-09 01:13:09,584 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 01:13:09,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 01:13:09,628 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 01:13:09,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:13:09 BoogieIcfgContainer [2025-01-09 01:13:09,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 01:13:09,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 01:13:09,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 01:13:09,635 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 01:13:09,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:13:05" (3/4) ... [2025-01-09 01:13:09,637 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 01:13:09,643 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2025-01-09 01:13:09,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 01:13:09,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-09 01:13:09,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 01:13:09,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 01:13:09,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 01:13:09,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 01:13:09,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 01:13:09,704 INFO L158 Benchmark]: Toolchain (without parser) took 5189.21ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 49.6MB in the end (delta: 41.3MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2025-01-09 01:13:09,704 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:13:09,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.13ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 78.6MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:13:09,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.84ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 77.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:13:09,705 INFO L158 Benchmark]: Boogie Preprocessor took 43.72ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:13:09,705 INFO L158 Benchmark]: RCFGBuilder took 255.58ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 63.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 01:13:09,705 INFO L158 Benchmark]: TraceAbstraction took 4596.06ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 55.4MB in the end (delta: 7.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-01-09 01:13:09,705 INFO L158 Benchmark]: Witness Printer took 66.83ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 49.6MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 01:13:09,706 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.17ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.13ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 78.6MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.84ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 77.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.72ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 255.58ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 63.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4596.06ms. Allocated memory is still 117.4MB. Free memory was 62.5MB in the beginning and 55.4MB in the end (delta: 7.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 66.83ms. Allocated memory is still 117.4MB. Free memory was 55.4MB in the beginning and 49.6MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 74]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 787 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 285 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 200 ConstructedInterpolants, 8 QuantifiedInterpolants, 304 SizeOfPredicates, 2 NumberOfNonLiveVariables, 769 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 01:13:09,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE