./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0730c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0730c.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f8c3d6863785ed03feeabfa34c0c11607b9ab236b069ea505eed9d256d26078d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 16:09:07,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 16:09:07,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 16:09:07,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 16:09:07,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 16:09:07,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 16:09:07,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 16:09:07,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 16:09:07,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 16:09:07,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 16:09:07,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 16:09:07,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 16:09:07,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 16:09:07,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 16:09:07,237 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 16:09:07,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 16:09:07,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 16:09:07,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 16:09:07,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 16:09:07,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 16:09:07,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 16:09:07,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 16:09:07,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:09:07,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 16:09:07,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 16:09:07,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 16:09:07,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 16:09:07,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 16:09:07,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 16:09:07,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 16:09:07,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 16:09:07,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 16:09:07,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 16:09:07,240 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/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 -> f8c3d6863785ed03feeabfa34c0c11607b9ab236b069ea505eed9d256d26078d [2025-03-16 16:09:07,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 16:09:07,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 16:09:07,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 16:09:07,518 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 16:09:07,518 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 16:09:07,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2025-03-16 16:09:08,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d362522/2b5f4dca477842bd8846e6dba9f95235/FLAG79728a21e [2025-03-16 16:09:08,997 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 16:09:08,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2025-03-16 16:09:09,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d362522/2b5f4dca477842bd8846e6dba9f95235/FLAG79728a21e [2025-03-16 16:09:09,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d362522/2b5f4dca477842bd8846e6dba9f95235 [2025-03-16 16:09:09,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 16:09:09,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 16:09:09,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 16:09:09,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 16:09:09,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 16:09:09,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294d4252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09, skipping insertion in model container [2025-03-16 16:09:09,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 16:09:09,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c[3223,3236] [2025-03-16 16:09:09,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:09:09,243 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 16:09:09,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c[3223,3236] [2025-03-16 16:09:09,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:09:09,298 INFO L204 MainTranslator]: Completed translation [2025-03-16 16:09:09,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09 WrapperNode [2025-03-16 16:09:09,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 16:09:09,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 16:09:09,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 16:09:09,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 16:09:09,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,349 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 318 [2025-03-16 16:09:09,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 16:09:09,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 16:09:09,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 16:09:09,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 16:09:09,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,381 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 3, 2, 3]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 2, 1, 1]. [2025-03-16 16:09:09,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 16:09:09,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 16:09:09,404 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 16:09:09,404 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 16:09:09,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (1/1) ... [2025-03-16 16:09:09,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:09:09,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 16:09:09,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 16:09:09,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 16:09:09,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 16:09:09,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 16:09:09,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 16:09:09,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 16:09:09,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 16:09:09,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 16:09:09,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-16 16:09:09,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-16 16:09:09,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 16:09:09,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 16:09:09,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 16:09:09,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 16:09:09,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 16:09:09,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 16:09:09,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 16:09:09,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 16:09:09,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 16:09:09,963 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-03-16 16:09:09,964 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 16:09:09,996 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 16:09:09,996 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-16 16:09:09,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:09:09 BoogieIcfgContainer [2025-03-16 16:09:09,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 16:09:09,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 16:09:09,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 16:09:10,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 16:09:10,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 04:09:09" (1/3) ... [2025-03-16 16:09:10,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba20b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:09:10, skipping insertion in model container [2025-03-16 16:09:10,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:09" (2/3) ... [2025-03-16 16:09:10,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba20b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:09:10, skipping insertion in model container [2025-03-16 16:09:10,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:09:09" (3/3) ... [2025-03-16 16:09:10,007 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730c.c [2025-03-16 16:09:10,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 16:09:10,021 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_0730c.c that has 1 procedures, 110 locations, 1 initial locations, 7 loop locations, and 4 error locations. [2025-03-16 16:09:10,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 16:09:10,074 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;@11c1d6e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 16:09:10,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-16 16:09:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 109 states have internal predecessors, (174), 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-03-16 16:09:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-16 16:09:10,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:10,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-16 16:09:10,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 1 more)] === [2025-03-16 16:09:10,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:10,086 INFO L85 PathProgramCache]: Analyzing trace with hash 7327, now seen corresponding path program 1 times [2025-03-16 16:09:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 16:09:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290017991] [2025-03-16 16:09:10,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:09:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 16:09:10,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-16 16:09:10,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-16 16:09:10,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:10,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 16:09:10,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 16:09:10,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-16 16:09:10,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-16 16:09:10,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:10,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 16:09:10,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 16:09:10,183 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 16:09:10,184 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONUNSUPPORTED_FEATURE (3 of 4 remaining) [2025-03-16 16:09:10,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-16 16:09:10,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (1 of 4 remaining) [2025-03-16 16:09:10,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 4 remaining) [2025-03-16 16:09:10,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 16:09:10,193 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-16 16:09:10,207 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 16:09:10,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 04:09:10 BoogieIcfgContainer [2025-03-16 16:09:10,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 16:09:10,211 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 16:09:10,211 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 16:09:10,212 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 16:09:10,212 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:09:09" (3/4) ... [2025-03-16 16:09:10,214 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 16:09:10,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 16:09:10,216 INFO L158 Benchmark]: Toolchain (without parser) took 1176.58ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 58.5MB in the end (delta: 65.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-16 16:09:10,216 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:09:10,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.59ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 110.8MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 16:09:10,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.86ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 107.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:09:10,218 INFO L158 Benchmark]: Boogie Preprocessor took 51.19ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 104.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:09:10,218 INFO L158 Benchmark]: IcfgBuilder took 593.04ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 72.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 16:09:10,218 INFO L158 Benchmark]: TraceAbstraction took 211.78ms. Allocated memory is still 167.8MB. Free memory was 71.4MB in the beginning and 58.5MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 16:09:10,219 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 167.8MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:09:10,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.59ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 110.8MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.86ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 107.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.19ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 104.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 593.04ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 72.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 211.78ms. Allocated memory is still 167.8MB. Free memory was 71.4MB in the beginning and 58.5MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 167.8MB. Free memory is still 58.5MB. 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: 28]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 28. Possible FailurePath: [L19] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L151] double x = 0.0; [L152] CALL __ieee754_sqrt(x) [L22] double z; [L23] __int32_t sign = 0x80000000; [L24] __uint32_t r, t1, s1, ix1, q1; [L25] __int32_t ix0, s0, q, m, t, i; VAL [one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L28] ieee_double_shape_type ew_u; VAL [one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] - UnprovableResult [Line: 156]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - UnprovableResult [Line: 123]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 110 locations, 174 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, 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=110occurred 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, 2 NumberOfCodeBlocks, 2 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-03-16 16:09:10,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0730c.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f8c3d6863785ed03feeabfa34c0c11607b9ab236b069ea505eed9d256d26078d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 16:09:12,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 16:09:12,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 16:09:12,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 16:09:12,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 16:09:12,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 16:09:12,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 16:09:12,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 16:09:12,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 16:09:12,288 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 16:09:12,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 16:09:12,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 16:09:12,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 16:09:12,289 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 16:09:12,290 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:09:12,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 16:09:12,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 16:09:12,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 16:09:12,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 16:09:12,291 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/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 -> f8c3d6863785ed03feeabfa34c0c11607b9ab236b069ea505eed9d256d26078d [2025-03-16 16:09:12,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 16:09:12,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 16:09:12,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 16:09:12,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 16:09:12,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 16:09:12,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2025-03-16 16:09:13,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e8ff6cf/548a2e3159264ea6aabe2ecc2a554399/FLAGb36729486 [2025-03-16 16:09:13,987 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 16:09:13,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2025-03-16 16:09:13,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e8ff6cf/548a2e3159264ea6aabe2ecc2a554399/FLAGb36729486 [2025-03-16 16:09:14,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e8ff6cf/548a2e3159264ea6aabe2ecc2a554399 [2025-03-16 16:09:14,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 16:09:14,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 16:09:14,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 16:09:14,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 16:09:14,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 16:09:14,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6da97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14, skipping insertion in model container [2025-03-16 16:09:14,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 16:09:14,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c[3223,3236] [2025-03-16 16:09:14,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:09:14,212 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 16:09:14,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c[3223,3236] [2025-03-16 16:09:14,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:09:14,262 INFO L204 MainTranslator]: Completed translation [2025-03-16 16:09:14,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14 WrapperNode [2025-03-16 16:09:14,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 16:09:14,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 16:09:14,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 16:09:14,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 16:09:14,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,303 INFO L138 Inliner]: procedures = 20, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2025-03-16 16:09:14,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 16:09:14,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 16:09:14,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 16:09:14,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 16:09:14,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,330 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 3, 2, 3]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 2, 1, 1]. [2025-03-16 16:09:14,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 16:09:14,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 16:09:14,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 16:09:14,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 16:09:14,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (1/1) ... [2025-03-16 16:09:14,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:09:14,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 16:09:14,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 16:09:14,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 16:09:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 16:09:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-16 16:09:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-16 16:09:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-16 16:09:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-16 16:09:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-16 16:09:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-16 16:09:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-16 16:09:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-16 16:09:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 16:09:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 16:09:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-16 16:09:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-16 16:09:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 16:09:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-16 16:09:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-16 16:09:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-16 16:09:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-16 16:09:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 16:09:14,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 16:09:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-16 16:09:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-16 16:09:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-16 16:09:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-16 16:09:14,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 16:09:14,498 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 16:09:14,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 16:09:21,219 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-16 16:09:21,220 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 16:09:21,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 16:09:21,229 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 16:09:21,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:09:21 BoogieIcfgContainer [2025-03-16 16:09:21,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 16:09:21,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 16:09:21,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 16:09:21,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 16:09:21,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 04:09:14" (1/3) ... [2025-03-16 16:09:21,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a97490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:09:21, skipping insertion in model container [2025-03-16 16:09:21,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:09:14" (2/3) ... [2025-03-16 16:09:21,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a97490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:09:21, skipping insertion in model container [2025-03-16 16:09:21,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:09:21" (3/3) ... [2025-03-16 16:09:21,238 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730c.c [2025-03-16 16:09:21,250 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 16:09:21,251 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_0730c.c that has 1 procedures, 47 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-16 16:09:21,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 16:09:21,301 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;@400ad413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 16:09:21,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 16:09:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 46 states have internal predecessors, (74), 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-03-16 16:09:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 16:09:21,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:21,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:21,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:21,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2059195528, now seen corresponding path program 1 times [2025-03-16 16:09:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:21,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877500941] [2025-03-16 16:09:21,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:09:21,326 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-03-16 16:09:21,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:21,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-16 16:09:21,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:21,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 16:09:21,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 16:09:21,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:21,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:21,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 16:09:21,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:09:21,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:09:21,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:21,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877500941] [2025-03-16 16:09:21,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877500941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:09:21,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:09:21,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 16:09:21,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926001442] [2025-03-16 16:09:21,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:09:21,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 16:09:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:21,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 16:09:21,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 16:09:21,641 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 46 states have internal predecessors, (74), 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-03-16 16:09:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:21,652 INFO L93 Difference]: Finished difference Result 93 states and 147 transitions. [2025-03-16 16:09:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 16:09:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2025-03-16 16:09:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:21,658 INFO L225 Difference]: With dead ends: 93 [2025-03-16 16:09:21,659 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 16:09:21,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-03-16 16:09:21,663 INFO L435 NwaCegarLoop]: 67 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, 67 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-03-16 16:09:21,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:09:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 16:09:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-16 16:09:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 43 states have internal predecessors, (64), 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-03-16 16:09:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2025-03-16 16:09:21,685 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 7 [2025-03-16 16:09:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:21,685 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2025-03-16 16:09:21,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-03-16 16:09:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2025-03-16 16:09:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 16:09:21,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:21,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:21,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:21,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-16 16:09:21,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:21,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1337461606, now seen corresponding path program 1 times [2025-03-16 16:09:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394865260] [2025-03-16 16:09:21,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:09:21,888 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-03-16 16:09:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:21,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-16 16:09:21,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:21,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 16:09:22,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 16:09:22,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:22,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:22,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 16:09:22,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:09:22,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:09:22,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:22,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394865260] [2025-03-16 16:09:22,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394865260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:09:22,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:09:22,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 16:09:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658585366] [2025-03-16 16:09:22,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:09:22,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:09:22,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:22,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:09:22,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:09:22,474 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03-16 16:09:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:23,614 INFO L93 Difference]: Finished difference Result 84 states and 121 transitions. [2025-03-16 16:09:23,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:09:23,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-03-16 16:09:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:23,615 INFO L225 Difference]: With dead ends: 84 [2025-03-16 16:09:23,615 INFO L226 Difference]: Without dead ends: 47 [2025-03-16 16:09:23,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 16:09:23,616 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 16:09:23,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 89 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 16:09:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-16 16:09:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-16 16:09:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 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-03-16 16:09:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2025-03-16 16:09:23,620 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 8 [2025-03-16 16:09:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:23,620 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2025-03-16 16:09:23,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03-16 16:09:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2025-03-16 16:09:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 16:09:23,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:23,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:23,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 16:09:23,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-16 16:09:23,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:23,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:23,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1404132406, now seen corresponding path program 1 times [2025-03-16 16:09:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027886524] [2025-03-16 16:09:23,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:09:23,822 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-03-16 16:09:23,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:23,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-16 16:09:23,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:23,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 16:09:23,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 16:09:23,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:23,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:23,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 16:09:23,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:09:24,223 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:09:24,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:24,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027886524] [2025-03-16 16:09:24,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027886524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:09:24,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:09:24,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:09:24,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639174886] [2025-03-16 16:09:24,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:09:24,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 16:09:24,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:24,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 16:09:24,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 16:09:24,224 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-03-16 16:09:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:24,487 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2025-03-16 16:09:24,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 16:09:24,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2025-03-16 16:09:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:24,488 INFO L225 Difference]: With dead ends: 50 [2025-03-16 16:09:24,488 INFO L226 Difference]: Without dead ends: 47 [2025-03-16 16:09:24,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 16:09:24,488 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 16:09:24,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 172 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 16:09:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-16 16:09:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-16 16:09:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 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-03-16 16:09:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2025-03-16 16:09:24,492 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 10 [2025-03-16 16:09:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:24,492 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2025-03-16 16:09:24,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-03-16 16:09:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2025-03-16 16:09:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 16:09:24,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:24,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:24,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:24,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-16 16:09:24,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:24,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1799110963, now seen corresponding path program 1 times [2025-03-16 16:09:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:24,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659610554] [2025-03-16 16:09:24,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:09:24,696 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-03-16 16:09:24,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:24,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-16 16:09:24,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:24,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 16:09:24,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 16:09:24,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:24,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:24,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 16:09:24,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:09:25,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:09:25,639 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:25,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659610554] [2025-03-16 16:09:25,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659610554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:09:25,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:09:25,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 16:09:25,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38039784] [2025-03-16 16:09:25,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:09:25,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 16:09:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:25,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 16:09:25,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 16:09:25,640 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-03-16 16:09:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:26,487 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-03-16 16:09:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 16:09:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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) Word has length 13 [2025-03-16 16:09:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:26,488 INFO L225 Difference]: With dead ends: 53 [2025-03-16 16:09:26,488 INFO L226 Difference]: Without dead ends: 45 [2025-03-16 16:09:26,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 16:09:26,489 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 16:09:26,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 331 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 16:09:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-16 16:09:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-16 16:09:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 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-03-16 16:09:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2025-03-16 16:09:26,492 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 13 [2025-03-16 16:09:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:26,492 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2025-03-16 16:09:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-03-16 16:09:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2025-03-16 16:09:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 16:09:26,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:26,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:26,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-16 16:09:26,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-16 16:09:26,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:26,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1683922158, now seen corresponding path program 1 times [2025-03-16 16:09:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467545357] [2025-03-16 16:09:26,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:09:26,695 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-03-16 16:09:26,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:26,697 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-16 16:09:26,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:26,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 16:09:26,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 16:09:26,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:26,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:26,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 16:09:26,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 16:09:27,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:09:27,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:27,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467545357] [2025-03-16 16:09:27,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467545357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:09:27,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:09:27,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:09:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988686387] [2025-03-16 16:09:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:09:27,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 16:09:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:27,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 16:09:27,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 16:09:27,303 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-03-16 16:09:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:28,245 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2025-03-16 16:09:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 16:09:28,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 25 [2025-03-16 16:09:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:28,246 INFO L225 Difference]: With dead ends: 78 [2025-03-16 16:09:28,246 INFO L226 Difference]: Without dead ends: 45 [2025-03-16 16:09:28,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 16:09:28,247 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 54 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 16:09:28,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 130 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 16:09:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-16 16:09:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-16 16:09:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 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-03-16 16:09:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2025-03-16 16:09:28,250 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 25 [2025-03-16 16:09:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:28,250 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-03-16 16:09:28,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-03-16 16:09:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2025-03-16 16:09:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 16:09:28,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:28,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:28,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-16 16:09:28,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-03-16 16:09:28,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:28,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:28,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2104146054, now seen corresponding path program 1 times [2025-03-16 16:09:28,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:28,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087750082] [2025-03-16 16:09:28,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:09:28,452 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-03-16 16:09:28,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:28,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-03-16 16:09:28,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:28,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 16:09:28,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 16:09:28,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:28,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:28,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 16:09:28,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 16:09:28,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:09:28,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087750082] [2025-03-16 16:09:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087750082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:09:28,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:09:28,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 16:09:28,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343574120] [2025-03-16 16:09:28,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:09:28,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 16:09:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:28,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 16:09:28,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 16:09:28,577 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-03-16 16:09:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:28,734 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2025-03-16 16:09:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 16:09:28,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 28 [2025-03-16 16:09:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:28,735 INFO L225 Difference]: With dead ends: 75 [2025-03-16 16:09:28,736 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 16:09:28,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 16:09:28,736 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 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.2s IncrementalHoareTripleChecker+Time [2025-03-16 16:09:28,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 16:09:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 16:09:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-03-16 16:09:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 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-03-16 16:09:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2025-03-16 16:09:28,742 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 28 [2025-03-16 16:09:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:28,743 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2025-03-16 16:09:28,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-03-16 16:09:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2025-03-16 16:09:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 16:09:28,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:28,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:28,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:28,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-03-16 16:09:28,944 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:28,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:28,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1603197138, now seen corresponding path program 1 times [2025-03-16 16:09:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:28,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396351750] [2025-03-16 16:09:28,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:09:28,945 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-03-16 16:09:28,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:28,946 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-03-16 16:09:28,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:28,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 16:09:29,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 16:09:29,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:29,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:29,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:09:29,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 16:09:29,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 16:09:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 16:09:29,360 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396351750] [2025-03-16 16:09:29,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396351750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 16:09:29,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 16:09:29,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-16 16:09:29,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747830398] [2025-03-16 16:09:29,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 16:09:29,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 16:09:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:29,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 16:09:29,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 16:09:29,361 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-03-16 16:09:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:29,679 INFO L93 Difference]: Finished difference Result 82 states and 113 transitions. [2025-03-16 16:09:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 16:09:29,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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) Word has length 31 [2025-03-16 16:09:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:29,680 INFO L225 Difference]: With dead ends: 82 [2025-03-16 16:09:29,680 INFO L226 Difference]: Without dead ends: 55 [2025-03-16 16:09:29,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 16:09:29,681 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 16:09:29,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 109 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 16:09:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-16 16:09:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-16 16:09:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 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-03-16 16:09:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-03-16 16:09:29,684 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 31 [2025-03-16 16:09:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:29,684 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-03-16 16:09:29,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-03-16 16:09:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-03-16 16:09:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 16:09:29,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:29,685 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:29,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:29,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-03-16 16:09:29,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:29,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash 691244666, now seen corresponding path program 2 times [2025-03-16 16:09:29,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:29,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470736225] [2025-03-16 16:09:29,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 16:09:29,886 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-03-16 16:09:29,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:29,888 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-03-16 16:09:29,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:29,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-16 16:09:29,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 40 statements. [2025-03-16 16:09:29,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 16:09:29,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:29,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:09:29,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 16:09:30,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:09:30,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470736225] [2025-03-16 16:09:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470736225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:09:30,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:09:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 16:09:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906161081] [2025-03-16 16:09:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:09:30,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:09:30,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:30,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:09:30,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:09:30,556 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-03-16 16:09:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:30,955 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2025-03-16 16:09:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:09:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) Word has length 40 [2025-03-16 16:09:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:30,956 INFO L225 Difference]: With dead ends: 87 [2025-03-16 16:09:30,956 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 16:09:30,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 16:09:30,957 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 51 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 16:09:30,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 109 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 16:09:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 16:09:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2025-03-16 16:09:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 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-03-16 16:09:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2025-03-16 16:09:30,962 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 40 [2025-03-16 16:09:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:30,963 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2025-03-16 16:09:30,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-03-16 16:09:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2025-03-16 16:09:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 16:09:30,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:30,963 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:30,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:31,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-03-16 16:09:31,164 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:31,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2022437287, now seen corresponding path program 1 times [2025-03-16 16:09:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:31,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444501141] [2025-03-16 16:09:31,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:09:31,165 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-03-16 16:09:31,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:31,166 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-03-16 16:09:31,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:31,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 16:09:31,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 16:09:31,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:09:31,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:31,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 16:09:31,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 16:09:31,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 16:09:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 16:09:32,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:32,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444501141] [2025-03-16 16:09:32,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444501141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 16:09:32,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 16:09:32,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-16 16:09:32,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506525123] [2025-03-16 16:09:32,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 16:09:32,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 16:09:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:32,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 16:09:32,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-03-16 16:09:32,578 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 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-03-16 16:09:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:34,056 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2025-03-16 16:09:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 16:09:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 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) Word has length 43 [2025-03-16 16:09:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:34,057 INFO L225 Difference]: With dead ends: 102 [2025-03-16 16:09:34,058 INFO L226 Difference]: Without dead ends: 74 [2025-03-16 16:09:34,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-03-16 16:09:34,058 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 16:09:34,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 409 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 16:09:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-16 16:09:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-16 16:09:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 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-03-16 16:09:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2025-03-16 16:09:34,064 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 43 [2025-03-16 16:09:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:34,064 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-03-16 16:09:34,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 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-03-16 16:09:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2025-03-16 16:09:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 16:09:34,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:09:34,065 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:34,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:34,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-03-16 16:09:34,270 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:09:34,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:09:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash 387524391, now seen corresponding path program 2 times [2025-03-16 16:09:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:09:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583001187] [2025-03-16 16:09:34,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 16:09:34,271 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-03-16 16:09:34,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:09:34,274 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-03-16 16:09:34,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:34,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-16 16:09:34,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 61 statements. [2025-03-16 16:09:34,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 16:09:34,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:09:34,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 16:09:34,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:09:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-16 16:09:34,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:09:34,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:09:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583001187] [2025-03-16 16:09:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583001187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:09:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:09:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 16:09:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112735013] [2025-03-16 16:09:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:09:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:09:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:09:34,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:09:34,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:09:34,929 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-03-16 16:09:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:09:35,090 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2025-03-16 16:09:35,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:09:35,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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) Word has length 61 [2025-03-16 16:09:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:09:35,091 INFO L225 Difference]: With dead ends: 74 [2025-03-16 16:09:35,091 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 16:09:35,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 16:09:35,092 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 16:09:35,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:09:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 16:09:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 16:09:35,092 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-03-16 16:09:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 16:09:35,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2025-03-16 16:09:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:09:35,093 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 16:09:35,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-03-16 16:09:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 16:09:35,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 16:09:35,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 16:09:35,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 16:09:35,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-03-16 16:09:35,298 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 16:09:35,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 16:09:35,430 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 16:09:35,437 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~64 [2025-03-16 16:09:35,438 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~64 [2025-03-16 16:09:35,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 04:09:35 BoogieIcfgContainer [2025-03-16 16:09:35,439 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 16:09:35,440 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 16:09:35,440 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 16:09:35,440 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 16:09:35,440 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:09:21" (3/4) ... [2025-03-16 16:09:35,442 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 16:09:35,448 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-16 16:09:35,449 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-16 16:09:35,449 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 16:09:35,449 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 16:09:35,510 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 16:09:35,510 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 16:09:35,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 16:09:35,511 INFO L158 Benchmark]: Toolchain (without parser) took 21491.69ms. Allocated memory is still 83.9MB. Free memory was 58.4MB in the beginning and 33.9MB in the end (delta: 24.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2025-03-16 16:09:35,511 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:09:35,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.03ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 44.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 16:09:35,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.98ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 42.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:09:35,514 INFO L158 Benchmark]: Boogie Preprocessor took 39.27ms. Allocated memory is still 83.9MB. Free memory was 42.6MB in the beginning and 40.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:09:35,514 INFO L158 Benchmark]: IcfgBuilder took 6885.60ms. Allocated memory is still 83.9MB. Free memory was 40.2MB in the beginning and 49.4MB in the end (delta: -9.2MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2025-03-16 16:09:35,514 INFO L158 Benchmark]: TraceAbstraction took 14207.70ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 40.6MB in the end (delta: 8.1MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2025-03-16 16:09:35,515 INFO L158 Benchmark]: Witness Printer took 70.94ms. Allocated memory is still 83.9MB. Free memory was 40.6MB in the beginning and 33.9MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:09:35,516 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.03ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 44.5MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.98ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 42.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.27ms. Allocated memory is still 83.9MB. Free memory was 42.6MB in the beginning and 40.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 6885.60ms. Allocated memory is still 83.9MB. Free memory was 40.2MB in the beginning and 49.4MB in the end (delta: -9.2MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14207.70ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 40.6MB in the end (delta: 8.1MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Witness Printer took 70.94ms. Allocated memory is still 83.9MB. Free memory was 40.6MB in the beginning and 33.9MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~64 * 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: 156]: 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 1 procedures, 47 locations, 74 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 1521 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1015 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 388 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 506 mSDtfsCounter, 388 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 266 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 328 ConstructedInterpolants, 15 QuantifiedInterpolants, 827 SizeOfPredicates, 15 NumberOfNonLiveVariables, 754 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 177/223 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 - InvariantResult [Line: 84]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 47]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (sign == -2147483648) - InvariantResult [Line: 71]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 52]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 122]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-03-16 16:09:35,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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