./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 798a7b37 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-?-798a7b3-m [2025-03-03 11:50:46,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:50:46,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:50:46,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:50:46,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:50:46,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:50:46,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:50:46,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:50:46,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:50:46,472 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:50:46,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:50:46,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:50:46,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:50:46,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:50:46,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:50:46,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:50:46,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:50:46,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:50:46,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:50:46,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:50:46,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:50:46,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:50:46,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:50:46,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:50:46,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:50:46,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:50:46,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:50:46,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:50:46,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:50:46,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:50:46,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:50:46,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:50:46,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:50:46,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:50:46,477 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-03 11:50:46,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:50:46,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:50:46,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:50:46,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:50:46,757 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:50:46,759 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-03 11:50:47,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a31cc41/6d3a90aeaafc4763bbcc603fa33a4183/FLAG4fb69c754 [2025-03-03 11:50:48,245 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:50:48,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2025-03-03 11:50:48,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a31cc41/6d3a90aeaafc4763bbcc603fa33a4183/FLAG4fb69c754 [2025-03-03 11:50:48,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a31cc41/6d3a90aeaafc4763bbcc603fa33a4183 [2025-03-03 11:50:48,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:50:48,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:50:48,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:50:48,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:50:48,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:50:48,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75854446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48, skipping insertion in model container [2025-03-03 11:50:48,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:50:48,701 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-03 11:50:48,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:50:48,711 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:50:48,752 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-03 11:50:48,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:50:48,771 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:50:48,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48 WrapperNode [2025-03-03 11:50:48,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:50:48,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:50:48,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:50:48,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:50:48,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,823 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 318 [2025-03-03 11:50:48,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:50:48,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:50:48,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:50:48,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:50:48,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,865 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 3, 3, 2]. 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-03 11:50:48,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:50:48,892 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:50:48,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:50:48,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:50:48,895 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (1/1) ... [2025-03-03 11:50:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:50:48,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:50:48,923 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-03 11:50:48,927 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-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-03 11:50:48,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:50:48,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 11:50:48,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 11:50:49,020 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:50:49,022 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:50:49,439 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-03-03 11:50:49,439 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:50:49,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:50:49,471 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 11:50:49,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:49 BoogieIcfgContainer [2025-03-03 11:50:49,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:50:49,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:50:49,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:50:49,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:50:49,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:50:48" (1/3) ... [2025-03-03 11:50:49,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32211195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:50:49, skipping insertion in model container [2025-03-03 11:50:49,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:48" (2/3) ... [2025-03-03 11:50:49,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32211195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:50:49, skipping insertion in model container [2025-03-03 11:50:49,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:49" (3/3) ... [2025-03-03 11:50:49,481 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730c.c [2025-03-03 11:50:49,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:50:49,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_0730c.c that has 1 procedures, 112 locations, 1 initial locations, 7 loop locations, and 4 error locations. [2025-03-03 11:50:49,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:50:49,558 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;@5dde812b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:50:49,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-03 11:50:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 107 states have (on average 1.644859813084112) internal successors, (176), 111 states have internal predecessors, (176), 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-03 11:50:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-03 11:50:49,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:50:49,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-03 11:50:49,567 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-03 11:50:49,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:50:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash 230343, now seen corresponding path program 1 times [2025-03-03 11:50:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:50:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476169133] [2025-03-03 11:50:49,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:50:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:50:49,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-03 11:50:49,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-03 11:50:49,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:50:49,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:50:49,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 11:50:49,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-03 11:50:49,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-03 11:50:49,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:50:49,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:50:49,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 11:50:49,678 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 11:50:49,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONUNSUPPORTED_FEATURE (3 of 4 remaining) [2025-03-03 11:50:49,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-03 11:50:49,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (1 of 4 remaining) [2025-03-03 11:50:49,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 4 remaining) [2025-03-03 11:50:49,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:50:49,685 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-03 11:50:49,702 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:50:49,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:50:49 BoogieIcfgContainer [2025-03-03 11:50:49,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:50:49,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:50:49,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:50:49,708 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:50:49,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:49" (3/4) ... [2025-03-03 11:50:49,711 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 11:50:49,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:50:49,713 INFO L158 Benchmark]: Toolchain (without parser) took 1200.77ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 46.5MB in the end (delta: 66.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 11:50:49,714 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:50:49,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.05ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.7MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:50:49,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.01ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:50:49,715 INFO L158 Benchmark]: Boogie Preprocessor took 63.01ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:50:49,715 INFO L158 Benchmark]: IcfgBuilder took 579.69ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 60.2MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 11:50:49,715 INFO L158 Benchmark]: TraceAbstraction took 233.12ms. Allocated memory is still 142.6MB. Free memory was 59.8MB in the beginning and 46.9MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 11:50:49,715 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 142.6MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:50:49,717 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.81ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.05ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 98.7MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.01ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.01ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 579.69ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 60.2MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 233.12ms. Allocated memory is still 142.6MB. Free memory was 59.8MB in the beginning and 46.9MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 142.6MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [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, 112 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred 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, 3 NumberOfCodeBlocks, 3 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-03 11:50:49,732 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 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-?-798a7b3-m [2025-03-03 11:50:51,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:50:51,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 11:50:51,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:50:51,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:50:51,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:50:51,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:50:51,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:50:51,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:50:51,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:50:51,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:50:51,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:50:51,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:50:51,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:50:51,934 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:50:51,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:50:51,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:50:51,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:50:51,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:50:51,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:50:51,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:50:51,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:50:51,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:50:51,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 11:50:51,936 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 11:50:51,936 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 11:50:51,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:50:51,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:50:51,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:50:51,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:50:51,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:50:51,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:50:51,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:50:51,937 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-03 11:50:52,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:50:52,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:50:52,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:50:52,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:50:52,205 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:50:52,206 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-03 11:50:53,497 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e844b4501/e7b236cb3a2a4871bf113a778c9e523f/FLAG7710f81eb [2025-03-03 11:50:53,699 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:50:53,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730c.c [2025-03-03 11:50:53,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e844b4501/e7b236cb3a2a4871bf113a778c9e523f/FLAG7710f81eb [2025-03-03 11:50:53,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e844b4501/e7b236cb3a2a4871bf113a778c9e523f [2025-03-03 11:50:53,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:50:53,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:50:53,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:50:53,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:50:53,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:50:53,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:53,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41cfa070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53, skipping insertion in model container [2025-03-03 11:50:53,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:53,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:50:53,916 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-03 11:50:53,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:50:53,937 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:50:53,973 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-03 11:50:53,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:50:53,989 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:50:53,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53 WrapperNode [2025-03-03 11:50:53,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:50:53,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:50:53,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:50:53,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:50:53,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,027 INFO L138 Inliner]: procedures = 20, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2025-03-03 11:50:54,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:50:54,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:50:54,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:50:54,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:50:54,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,058 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 2, 3, 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, 1, 2, 1]. [2025-03-03 11:50:54,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:50:54,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:50:54,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:50:54,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:50:54,077 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (1/1) ... [2025-03-03 11:50:54,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:50:54,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:50:54,109 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-03 11:50:54,111 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-03 11:50:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:50:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-03 11:50:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-03 11:50:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-03 11:50:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-03 11:50:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-03 11:50:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-03 11:50:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-03 11:50:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-03 11:50:54,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:50:54,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:50:54,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-03 11:50:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-03 11:50:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-03 11:50:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-03 11:50:54,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 11:50:54,212 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:50:54,213 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:50:59,688 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-03 11:50:59,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:50:59,696 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:50:59,696 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:50:59,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:59 BoogieIcfgContainer [2025-03-03 11:50:59,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:50:59,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:50:59,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:50:59,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:50:59,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:50:53" (1/3) ... [2025-03-03 11:50:59,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80f830d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:50:59, skipping insertion in model container [2025-03-03 11:50:59,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:50:53" (2/3) ... [2025-03-03 11:50:59,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80f830d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:50:59, skipping insertion in model container [2025-03-03 11:50:59,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:59" (3/3) ... [2025-03-03 11:50:59,704 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730c.c [2025-03-03 11:50:59,715 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:50:59,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_0730c.c that has 1 procedures, 49 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-03 11:50:59,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:50:59,762 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;@167bc4be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:50:59,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:50:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 48 states have internal predecessors, (76), 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-03 11:50:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 11:50:59,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:50:59,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:50:59,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:50:59,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:50:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1032525319, now seen corresponding path program 1 times [2025-03-03 11:50:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:50:59,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314236555] [2025-03-03 11:50:59,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:50:59,786 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-03 11:50:59,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:50:59,790 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-03 11:50:59,792 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-03 11:50:59,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 11:51:00,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 11:51:00,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:51:00,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:00,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 11:51:00,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:00,092 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-03 11:51:00,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:51:00,093 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314236555] [2025-03-03 11:51:00,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314236555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:51:00,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:51:00,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:51:00,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752709185] [2025-03-03 11:51:00,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:51:00,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 11:51:00,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:00,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 11:51:00,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 11:51:00,113 INFO L87 Difference]: Start difference. First operand has 49 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 48 states have internal predecessors, (76), 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 4.0) internal successors, (8), 2 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-03 11:51:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:00,129 INFO L93 Difference]: Finished difference Result 96 states and 150 transitions. [2025-03-03 11:51:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 11:51:00,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-03 11:51:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:00,139 INFO L225 Difference]: With dead ends: 96 [2025-03-03 11:51:00,140 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 11:51:00,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-03 11:51:00,146 INFO L435 NwaCegarLoop]: 69 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, 69 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-03 11:51:00,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:51:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 11:51:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 11:51:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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-03 11:51:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-03-03 11:51:00,182 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 8 [2025-03-03 11:51:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:00,183 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-03-03 11:51:00,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-03 11:51:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-03-03 11:51:00,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 11:51:00,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:51:00,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:51:00,195 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-03 11:51:00,389 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-03 11:51:00,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:51:00,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:51:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1603441867, now seen corresponding path program 1 times [2025-03-03 11:51:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:51:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250128886] [2025-03-03 11:51:00,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:51:00,391 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-03 11:51:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:51:00,396 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-03 11:51:00,397 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-03 11:51:00,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 11:51:00,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 11:51:00,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:51:00,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:00,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 11:51:00,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:00,969 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-03 11:51:00,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:51:00,969 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250128886] [2025-03-03 11:51:00,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250128886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:51:00,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:51:00,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:51:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042807533] [2025-03-03 11:51:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:51:00,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:51:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:00,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:51:00,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:51:00,974 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03 11:51:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:02,085 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2025-03-03 11:51:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:51:02,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-03 11:51:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:02,086 INFO L225 Difference]: With dead ends: 87 [2025-03-03 11:51:02,086 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 11:51:02,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-03 11:51:02,087 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 60 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 95 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-03 11:51:02,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 95 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:51:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 11:51:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-03-03 11:51:02,090 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-03 11:51:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2025-03-03 11:51:02,091 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 9 [2025-03-03 11:51:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:02,091 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2025-03-03 11:51:02,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03 11:51:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2025-03-03 11:51:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 11:51:02,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:51:02,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:51:02,102 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-03 11:51:02,292 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-03 11:51:02,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:51:02,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:51:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1523950695, now seen corresponding path program 1 times [2025-03-03 11:51:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:51:02,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019751396] [2025-03-03 11:51:02,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:51:02,295 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-03 11:51:02,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:51:02,297 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-03 11:51:02,298 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-03 11:51:02,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 11:51:02,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 11:51:02,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:51:02,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:02,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 11:51:02,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:02,690 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-03 11:51:02,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:51:02,690 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:02,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019751396] [2025-03-03 11:51:02,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019751396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:51:02,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:51:02,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:51:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661692791] [2025-03-03 11:51:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:51:02,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:51:02,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:02,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:51:02,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:51:02,692 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-03 11:51:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:02,932 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2025-03-03 11:51:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:51:02,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2025-03-03 11:51:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:02,933 INFO L225 Difference]: With dead ends: 52 [2025-03-03 11:51:02,934 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 11:51:02,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-03 11:51:02,934 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 47 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:51:02,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 180 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 11:51:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 11:51:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 11:51:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 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-03 11:51:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2025-03-03 11:51:02,938 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 11 [2025-03-03 11:51:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:02,939 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2025-03-03 11:51:02,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-03 11:51:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2025-03-03 11:51:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 11:51:02,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:51:02,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:51:02,943 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-03 11:51:03,141 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-03 11:51:03,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:51:03,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:51:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash -834305725, now seen corresponding path program 1 times [2025-03-03 11:51:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:51:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293428920] [2025-03-03 11:51:03,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:51:03,142 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-03 11:51:03,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:51:03,144 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-03 11:51:03,145 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-03 11:51:03,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 11:51:03,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 11:51:03,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:51:03,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:03,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 11:51:03,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:04,327 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-03 11:51:04,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:51:04,327 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293428920] [2025-03-03 11:51:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293428920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:51:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:51:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 11:51:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130410229] [2025-03-03 11:51:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:51:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 11:51:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:04,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 11:51:04,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:51:04,329 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-03 11:51:05,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:05,405 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2025-03-03 11:51:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 11:51:05,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 15 [2025-03-03 11:51:05,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:05,406 INFO L225 Difference]: With dead ends: 56 [2025-03-03 11:51:05,406 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 11:51:05,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 11:51:05,408 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 50 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:51:05,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 396 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 11:51:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 11:51:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 11:51:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 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-03 11:51:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2025-03-03 11:51:05,414 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 15 [2025-03-03 11:51:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:05,415 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2025-03-03 11:51:05,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-03 11:51:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2025-03-03 11:51:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 11:51:05,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:51:05,415 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] [2025-03-03 11:51:05,420 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-03 11:51:05,617 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-03 11:51:05,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:51:05,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:51:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 609929823, now seen corresponding path program 1 times [2025-03-03 11:51:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:51:05,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995340532] [2025-03-03 11:51:05,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:51:05,619 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-03 11:51:05,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:51:05,621 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-03 11:51:05,622 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-03 11:51:05,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 11:51:05,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 11:51:05,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:51:05,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:05,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 11:51:05,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:06,325 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-03 11:51:06,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:51:06,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995340532] [2025-03-03 11:51:06,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995340532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:51:06,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:51:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:51:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790239983] [2025-03-03 11:51:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:51:06,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:51:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:06,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:51:06,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:51:06,326 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-03 11:51:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:07,284 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2025-03-03 11:51:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:51:07,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2025-03-03 11:51:07,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:07,289 INFO L225 Difference]: With dead ends: 81 [2025-03-03 11:51:07,289 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 11:51:07,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:51:07,290 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 138 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-03 11:51:07,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 138 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 11:51:07,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 11:51:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 11:51:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 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-03 11:51:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2025-03-03 11:51:07,295 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 26 [2025-03-03 11:51:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:07,295 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2025-03-03 11:51:07,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-03 11:51:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2025-03-03 11:51:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 11:51:07,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:51:07,296 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] [2025-03-03 11:51:07,300 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-03 11:51:07,496 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-03 11:51:07,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:51:07,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:51:07,497 INFO L85 PathProgramCache]: Analyzing trace with hash 98465707, now seen corresponding path program 1 times [2025-03-03 11:51:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:51:07,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793969188] [2025-03-03 11:51:07,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:51:07,497 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-03 11:51:07,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:51:07,499 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-03 11:51:07,501 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-03 11:51:07,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 11:51:07,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 11:51:07,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:51:07,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:07,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:51:07,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:07,637 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-03 11:51:07,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:51:07,637 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:07,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793969188] [2025-03-03 11:51:07,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793969188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:51:07,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:51:07,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:51:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326705098] [2025-03-03 11:51:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:51:07,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:51:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:07,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:51:07,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:51:07,639 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-03 11:51:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:07,807 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2025-03-03 11:51:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:51:07,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2025-03-03 11:51:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:07,808 INFO L225 Difference]: With dead ends: 78 [2025-03-03 11:51:07,808 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 11:51:07,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-03 11:51:07,809 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 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-03 11:51:07,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 11:51:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 11:51:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-03 11:51:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 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-03 11:51:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2025-03-03 11:51:07,813 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 29 [2025-03-03 11:51:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:07,813 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2025-03-03 11:51:07,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-03 11:51:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2025-03-03 11:51:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 11:51:07,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:51:07,814 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, 1] [2025-03-03 11:51:07,819 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-03 11:51:08,014 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-03 11:51:08,014 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:51:08,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:51:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2104664929, now seen corresponding path program 1 times [2025-03-03 11:51:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:51:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526040257] [2025-03-03 11:51:08,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:51:08,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:51:08,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:51:08,017 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-03 11:51:08,018 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-03 11:51:08,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 11:51:08,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 11:51:08,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:51:08,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:08,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:51:08,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:08,270 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-03 11:51:08,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:51:08,478 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-03 11:51:08,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526040257] [2025-03-03 11:51:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526040257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:51:08,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:51:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-03 11:51:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912388919] [2025-03-03 11:51:08,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 11:51:08,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 11:51:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:08,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 11:51:08,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:51:08,479 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-03 11:51:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:09,014 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2025-03-03 11:51:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 11:51:09,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 32 [2025-03-03 11:51:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:09,016 INFO L225 Difference]: With dead ends: 85 [2025-03-03 11:51:09,016 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 11:51:09,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 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-03 11:51:09,016 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 16 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:51:09,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 245 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 11:51:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 11:51:09,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 11:51:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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-03 11:51:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2025-03-03 11:51:09,024 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 32 [2025-03-03 11:51:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:09,024 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2025-03-03 11:51:09,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-03 11:51:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2025-03-03 11:51:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 11:51:09,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:51:09,025 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] [2025-03-03 11:51:09,031 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-03 11:51:09,229 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-03 11:51:09,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:51:09,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:51:09,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1734913707, now seen corresponding path program 2 times [2025-03-03 11:51:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:51:09,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137181271] [2025-03-03 11:51:09,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 11:51:09,231 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-03 11:51:09,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:51:09,233 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-03 11:51:09,234 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-03 11:51:09,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 11:51:09,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 41 statements. [2025-03-03 11:51:09,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 11:51:09,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:09,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:51:09,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:09,978 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-03 11:51:09,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:51:09,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137181271] [2025-03-03 11:51:09,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137181271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:51:09,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:51:09,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:51:09,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279987268] [2025-03-03 11:51:09,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:51:09,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:51:09,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:09,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:51:09,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:51:09,979 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-03 11:51:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:10,406 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2025-03-03 11:51:10,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:51:10,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 41 [2025-03-03 11:51:10,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:10,407 INFO L225 Difference]: With dead ends: 90 [2025-03-03 11:51:10,407 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 11:51:10,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-03 11:51:10,408 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 115 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.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:51:10,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 115 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 11:51:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 11:51:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2025-03-03 11:51:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 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-03 11:51:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2025-03-03 11:51:10,415 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2025-03-03 11:51:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:10,415 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2025-03-03 11:51:10,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-03 11:51:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2025-03-03 11:51:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 11:51:10,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:51:10,416 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, 1] [2025-03-03 11:51:10,422 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-03 11:51:10,617 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-03 11:51:10,617 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:51:10,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:51:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1594476776, now seen corresponding path program 1 times [2025-03-03 11:51:10,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:51:10,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275532088] [2025-03-03 11:51:10,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:51:10,618 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-03 11:51:10,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:51:10,620 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-03 11:51:10,623 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-03 11:51:10,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 11:51:10,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 11:51:10,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:51:10,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:10,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 11:51:10,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:11,403 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-03 11:51:11,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:51:12,255 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-03 11:51:12,255 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:12,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275532088] [2025-03-03 11:51:12,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275532088] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:51:12,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:51:12,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 11:51:12,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69677270] [2025-03-03 11:51:12,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 11:51:12,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 11:51:12,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:12,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 11:51:12,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-03-03 11:51:12,257 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-03 11:51:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:13,555 INFO L93 Difference]: Finished difference Result 105 states and 145 transitions. [2025-03-03 11:51:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 11:51:13,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 44 [2025-03-03 11:51:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:13,557 INFO L225 Difference]: With dead ends: 105 [2025-03-03 11:51:13,557 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 11:51:13,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-03-03 11:51:13,558 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 38 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:51:13,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 149 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:51:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 11:51:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-03 11:51:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 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-03 11:51:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2025-03-03 11:51:13,569 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 44 [2025-03-03 11:51:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:13,572 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2025-03-03 11:51:13,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-03 11:51:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2025-03-03 11:51:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 11:51:13,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:51:13,573 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, 1] [2025-03-03 11:51:13,582 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 (10)] Forceful destruction successful, exit code 0 [2025-03-03 11:51:13,774 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-03 11:51:13,774 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:51:13,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:51:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1583643496, now seen corresponding path program 2 times [2025-03-03 11:51:13,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:51:13,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268190208] [2025-03-03 11:51:13,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 11:51:13,775 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-03 11:51:13,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:51:13,777 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-03 11:51:13,778 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-03 11:51:13,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-03 11:51:13,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 62 statements. [2025-03-03 11:51:13,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 11:51:13,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:51:13,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 11:51:13,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:51:14,474 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-03 11:51:14,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:51:14,474 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:51:14,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268190208] [2025-03-03 11:51:14,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268190208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:51:14,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:51:14,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:51:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237668982] [2025-03-03 11:51:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:51:14,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:51:14,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:51:14,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:51:14,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:51:14,476 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03 11:51:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:51:14,650 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2025-03-03 11:51:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:51:14,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 62 [2025-03-03 11:51:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:51:14,651 INFO L225 Difference]: With dead ends: 76 [2025-03-03 11:51:14,651 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 11:51:14,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-03 11:51:14,651 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 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-03 11:51:14,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:51:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 11:51:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 11:51:14,652 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-03 11:51:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 11:51:14,652 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2025-03-03 11:51:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:51:14,652 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 11:51:14,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03 11:51:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 11:51:14,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 11:51:14,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 11:51:14,660 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-03 11:51:14,855 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-03 11:51:14,858 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 11:51:14,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 11:51:14,995 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:51:15,001 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~64 [2025-03-03 11:51:15,002 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~64 [2025-03-03 11:51:15,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:51:15 BoogieIcfgContainer [2025-03-03 11:51:15,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:51:15,005 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:51:15,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:51:15,006 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:51:15,006 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:50:59" (3/4) ... [2025-03-03 11:51:15,008 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 11:51:15,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-03 11:51:15,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-03 11:51:15,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 11:51:15,016 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 11:51:15,077 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 11:51:15,078 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 11:51:15,078 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:51:15,078 INFO L158 Benchmark]: Toolchain (without parser) took 21347.52ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 66.4MB in the end (delta: 26.1MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2025-03-03 11:51:15,078 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:51:15,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.76ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 11:51:15,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.70ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:51:15,079 INFO L158 Benchmark]: Boogie Preprocessor took 43.80ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:51:15,079 INFO L158 Benchmark]: IcfgBuilder took 5620.59ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 54.0MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 11:51:15,079 INFO L158 Benchmark]: TraceAbstraction took 15304.83ms. Allocated memory is still 117.4MB. Free memory was 53.4MB in the beginning and 72.8MB in the end (delta: -19.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:51:15,079 INFO L158 Benchmark]: Witness Printer took 72.42ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 66.4MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:51:15,080 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.76ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.70ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.80ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 5620.59ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 54.0MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15304.83ms. Allocated memory is still 117.4MB. Free memory was 53.4MB in the beginning and 72.8MB in the end (delta: -19.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.42ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 66.4MB in the end (delta: 6.4MB). There was no memory consumed. 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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 323 mSDsluCounter, 1499 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 975 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 524 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 277 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 341 ConstructedInterpolants, 15 QuantifiedInterpolants, 842 SizeOfPredicates, 15 NumberOfNonLiveVariables, 754 ConjunctsInSsa, 66 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-03 11:51:15,159 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 Writing output log to file Ultimate.log Result: TRUE