./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-benchs/interpolation2.c.p+cfa-reducer.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 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:46:39,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:46:40,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:46:40,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:46:40,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:46:40,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:46:40,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:46:40,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:46:40,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:46:40,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:46:40,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:46:40,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:46:40,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:46:40,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:46:40,056 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:46:40,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:46:40,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:46:40,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:46:40,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:46:40,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:46:40,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:46:40,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:46:40,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:46:40,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:46:40,057 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:46:40,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:46:40,057 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:46:40,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:46:40,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:46:40,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:46:40,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:46:40,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:46:40,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:46:40,058 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 -> 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 [2025-03-08 02:46:40,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:46:40,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:46:40,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:46:40,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:46:40,273 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:46:40,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2025-03-08 02:46:41,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f865958/fa2dfc1391124089b7a974b56adea95c/FLAG6afab03a2 [2025-03-08 02:46:41,609 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:46:41,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2025-03-08 02:46:41,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f865958/fa2dfc1391124089b7a974b56adea95c/FLAG6afab03a2 [2025-03-08 02:46:41,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f865958/fa2dfc1391124089b7a974b56adea95c [2025-03-08 02:46:41,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:46:41,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:46:41,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:46:41,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:46:41,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:46:41,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201a2c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41, skipping insertion in model container [2025-03-08 02:46:41,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:46:41,763 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-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2025-03-08 02:46:41,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:46:41,777 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:46:41,797 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-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2025-03-08 02:46:41,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:46:41,813 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:46:41,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41 WrapperNode [2025-03-08 02:46:41,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:46:41,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:46:41,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:46:41,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:46:41,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,844 INFO L138 Inliner]: procedures = 18, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 133 [2025-03-08 02:46:41,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:46:41,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:46:41,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:46:41,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:46:41,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,874 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 8, 6, 6, 8]. 27 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 5, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2025-03-08 02:46:41,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:46:41,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:46:41,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:46:41,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:46:41,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (1/1) ... [2025-03-08 02:46:41,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:46:41,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:46:41,924 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-08 02:46:41,930 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-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:46:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 02:46:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 02:46:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 02:46:42,009 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:46:42,010 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:46:42,112 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;call ULTIMATE.dealloc(main_~#main__min~0#1.base, main_~#main__min~0#1.offset);havoc main_~#main__min~0#1.base, main_~#main__min~0#1.offset;call ULTIMATE.dealloc(main_~#main__max~0#1.base, main_~#main__max~0#1.offset);havoc main_~#main__max~0#1.base, main_~#main__max~0#1.offset;call ULTIMATE.dealloc(main_~#main__org~0#1.base, main_~#main__org~0#1.offset);havoc main_~#main__org~0#1.base, main_~#main__org~0#1.offset;call ULTIMATE.dealloc(main_~#main__slope~0#1.base, main_~#main__slope~0#1.offset);havoc main_~#main__slope~0#1.base, main_~#main__slope~0#1.offset; [2025-03-08 02:46:42,117 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 02:46:42,117 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:46:42,123 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:46:42,123 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:46:42,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:46:42 BoogieIcfgContainer [2025-03-08 02:46:42,124 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:46:42,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:46:42,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:46:42,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:46:42,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:46:41" (1/3) ... [2025-03-08 02:46:42,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1896e758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:46:42, skipping insertion in model container [2025-03-08 02:46:42,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:41" (2/3) ... [2025-03-08 02:46:42,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1896e758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:46:42, skipping insertion in model container [2025-03-08 02:46:42,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:46:42" (3/3) ... [2025-03-08 02:46:42,130 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c.p+cfa-reducer.c [2025-03-08 02:46:42,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:46:42,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c.p+cfa-reducer.c that has 1 procedures, 19 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 02:46:42,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:46:42,185 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;@51af037e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:46:42,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:46:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-08 02:46:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 02:46:42,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:46:42,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:46:42,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:46:42,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:46:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1177248972, now seen corresponding path program 1 times [2025-03-08 02:46:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:46:42,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112376197] [2025-03-08 02:46:42,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:46:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:46:42,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 02:46:42,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 02:46:42,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:46:42,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:46:42,446 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-08 02:46:42,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:46:42,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112376197] [2025-03-08 02:46:42,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112376197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:46:42,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:46:42,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:46:42,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076134140] [2025-03-08 02:46:42,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:46:42,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:46:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:46:42,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:46:42,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:46:42,468 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-08 02:46:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:46:42,509 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2025-03-08 02:46:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:46:42,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-03-08 02:46:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:46:42,515 INFO L225 Difference]: With dead ends: 27 [2025-03-08 02:46:42,516 INFO L226 Difference]: Without dead ends: 17 [2025-03-08 02:46:42,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:46:42,521 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:46:42,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:46:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-08 02:46:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-03-08 02:46:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-08 02:46:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-08 02:46:42,545 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 12 [2025-03-08 02:46:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:46:42,545 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-08 02:46:42,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-08 02:46:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-03-08 02:46:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 02:46:42,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:46:42,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:46:42,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:46:42,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:46:42,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:46:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1176265869, now seen corresponding path program 1 times [2025-03-08 02:46:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:46:42,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862005562] [2025-03-08 02:46:42,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:46:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:46:42,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 02:46:42,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 02:46:42,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:46:42,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:46:42,630 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-08 02:46:42,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:46:42,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862005562] [2025-03-08 02:46:42,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862005562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:46:42,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:46:42,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:46:42,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434508830] [2025-03-08 02:46:42,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:46:42,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:46:42,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:46:42,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:46:42,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:46:42,632 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 02:46:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:46:42,644 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-08 02:46:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:46:42,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-03-08 02:46:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:46:42,645 INFO L225 Difference]: With dead ends: 34 [2025-03-08 02:46:42,645 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 02:46:42,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 02:46:42,646 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:46:42,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:46:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 02:46:42,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2025-03-08 02:46:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-08 02:46:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-08 02:46:42,652 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 12 [2025-03-08 02:46:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:46:42,653 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-08 02:46:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 02:46:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-08 02:46:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:46:42,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:46:42,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:46:42,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:46:42,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:46:42,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:46:42,656 INFO L85 PathProgramCache]: Analyzing trace with hash -346610445, now seen corresponding path program 1 times [2025-03-08 02:46:42,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:46:42,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21067316] [2025-03-08 02:46:42,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:46:42,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:46:42,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:46:42,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:46:42,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:46:42,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 02:46:42,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 02:46:42,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:46:42,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:46:42,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:46:42,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 02:46:42,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 02:46:42,710 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 02:46:42,711 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:46:42,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:46:42,715 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 02:46:42,732 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:46:42,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:46:42 BoogieIcfgContainer [2025-03-08 02:46:42,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:46:42,735 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:46:42,735 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:46:42,735 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:46:42,736 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:46:42" (3/4) ... [2025-03-08 02:46:42,738 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 02:46:42,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:46:42,739 INFO L158 Benchmark]: Toolchain (without parser) took 1108.07ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 39.2MB in the end (delta: 67.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 02:46:42,739 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:46:42,740 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.25ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:46:42,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.91ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:46:42,740 INFO L158 Benchmark]: Boogie Preprocessor took 45.70ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:46:42,740 INFO L158 Benchmark]: IcfgBuilder took 232.94ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 78.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:46:42,741 INFO L158 Benchmark]: TraceAbstraction took 608.95ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 39.9MB in the end (delta: 37.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 02:46:42,741 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 39.2MB in the end (delta: 752.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:46:42,742 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.25ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.91ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.5MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.70ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 232.94ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 78.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 608.95ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 39.9MB in the end (delta: 37.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 39.2MB in the end (delta: 752.0kB). 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: 53]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 25, overapproximation of someBinaryFLOATComparisonOperation at line 35, overapproximation of someBinaryFLOATComparisonOperation at line 23, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__org[5] = { 1, 5, -10, 30, 20 }; [L19] float main__org[5] = { 1, 5, -10, 30, 20 }; [L19] float main__org[5] = { 1, 5, -10, 30, 20 }; [L19] float main__org[5] = { 1, 5, -10, 30, 20 }; [L19] float main__org[5] = { 1, 5, -10, 30, 20 }; [L19] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L20] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L20] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L20] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L20] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L20] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] main__t = __VERIFIER_nondet_float() [L22] int main____CPAchecker_TMP_0; [L23] EXPR main__min[0] VAL [__return_main=0] [L23] COND TRUE main__t >= (main__min[0]) [L25] EXPR main__max[4UL] VAL [__return_main=0] [L25] COND TRUE main__t <= (main__max[4UL]) [L27] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__max={4:0}] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_main=0, main__i=0, main__max={4:0}] [L33] COND TRUE main__i < 5UL [L35] EXPR main__max[main__i] VAL [__return_main=0] [L35] COND TRUE main__t <= (main__max[main__i]) [L38] EXPR main__org[main__i] [L38] EXPR main__slope[main__i] [L38] EXPR main__min[main__i] [L38] EXPR main__max[main__i] [L38] EXPR main__min[main__i] [L38] main__z = (main__org[main__i]) + (((main__slope[main__i]) * (main__t - (main__min[main__i]))) / ((main__max[main__i]) - (main__min[main__i]))) [L39] int main____CPAchecker_TMP_1; VAL [__return_main=0, main__i=0, main__max={4:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_main=0, main__i=0, main__max={4:0}] [L65] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__i=0, main__max={4:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0, main__max={4:0}] [L53] reach_error() VAL [__return_main=0, main__i=0, main__max={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 26 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 40 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-08 02:46:42,758 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-benchs/interpolation2.c.p+cfa-reducer.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 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:46:44,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:46:44,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 02:46:44,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:46:44,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:46:44,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:46:44,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:46:44,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:46:44,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:46:44,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:46:44,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:46:44,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:46:44,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:46:44,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:46:44,864 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:46:44,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:46:44,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 02:46:44,865 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:46:44,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:46:44,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:46:44,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:46:44,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:46:44,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:46:44,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:46:44,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:46:44,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:46:44,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:46:44,867 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 -> 5c5b05c4ae88eb6dc9b39e487669b31df0ffdcd18c2998e1a9c5cebc84002587 [2025-03-08 02:46:45,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:46:45,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:46:45,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:46:45,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:46:45,135 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:46:45,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2025-03-08 02:46:46,268 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154a233ba/68c4124ecde9461188da3011c6b6a9d5/FLAG572c81c22 [2025-03-08 02:46:46,467 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:46:46,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c.p+cfa-reducer.c [2025-03-08 02:46:46,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154a233ba/68c4124ecde9461188da3011c6b6a9d5/FLAG572c81c22 [2025-03-08 02:46:46,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154a233ba/68c4124ecde9461188da3011c6b6a9d5 [2025-03-08 02:46:46,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:46:46,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:46:46,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:46:46,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:46:46,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:46:46,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:46:46" (1/1) ... [2025-03-08 02:46:46,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c39ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:46, skipping insertion in model container [2025-03-08 02:46:46,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:46:46" (1/1) ... [2025-03-08 02:46:46,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:46:46,975 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-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2025-03-08 02:46:46,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:46:46,987 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:46:47,008 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-benchs/interpolation2.c.p+cfa-reducer.c[1455,1468] [2025-03-08 02:46:47,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:46:47,029 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:46:47,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47 WrapperNode [2025-03-08 02:46:47,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:46:47,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:46:47,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:46:47,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:46:47,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,064 INFO L138 Inliner]: procedures = 19, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2025-03-08 02:46:47,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:46:47,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:46:47,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:46:47,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:46:47,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,092 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 8, 6, 8, 6]. 27 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 5, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2025-03-08 02:46:47,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:46:47,109 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:46:47,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:46:47,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:46:47,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (1/1) ... [2025-03-08 02:46:47,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:46:47,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:46:47,136 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-08 02:46:47,138 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-08 02:46:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:46:47,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:46:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 02:46:47,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:46:47,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:46:51,651 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;call ULTIMATE.dealloc(main_~#main__min~0#1.base, main_~#main__min~0#1.offset);havoc main_~#main__min~0#1.base, main_~#main__min~0#1.offset;call ULTIMATE.dealloc(main_~#main__max~0#1.base, main_~#main__max~0#1.offset);havoc main_~#main__max~0#1.base, main_~#main__max~0#1.offset;call ULTIMATE.dealloc(main_~#main__org~0#1.base, main_~#main__org~0#1.offset);havoc main_~#main__org~0#1.base, main_~#main__org~0#1.offset;call ULTIMATE.dealloc(main_~#main__slope~0#1.base, main_~#main__slope~0#1.offset);havoc main_~#main__slope~0#1.base, main_~#main__slope~0#1.offset; [2025-03-08 02:46:51,655 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 02:46:51,655 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:46:51,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:46:51,661 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:46:51,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:46:51 BoogieIcfgContainer [2025-03-08 02:46:51,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:46:51,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:46:51,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:46:51,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:46:51,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:46:46" (1/3) ... [2025-03-08 02:46:51,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a91162d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:46:51, skipping insertion in model container [2025-03-08 02:46:51,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:46:47" (2/3) ... [2025-03-08 02:46:51,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a91162d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:46:51, skipping insertion in model container [2025-03-08 02:46:51,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:46:51" (3/3) ... [2025-03-08 02:46:51,671 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c.p+cfa-reducer.c [2025-03-08 02:46:51,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:46:51,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c.p+cfa-reducer.c that has 1 procedures, 19 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 02:46:51,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:46:51,718 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;@4464cbf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:46:51,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:46:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-08 02:46:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 02:46:51,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:46:51,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:46:51,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:46:51,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:46:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1177248972, now seen corresponding path program 1 times [2025-03-08 02:46:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:46:51,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142572212] [2025-03-08 02:46:51,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:46:51,735 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-08 02:46:51,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:46:51,737 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-08 02:46:51,738 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-08 02:46:51,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 02:46:52,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 02:46:52,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:46:52,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:46:52,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:46:52,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:46:52,143 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-08 02:46:52,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:46:52,144 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:46:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142572212] [2025-03-08 02:46:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142572212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:46:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:46:52,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:46:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935005963] [2025-03-08 02:46:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:46:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:46:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:46:52,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:46:52,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:46:52,167 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 02:46:56,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:47:00,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:47:04,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:47:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:47:04,564 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2025-03-08 02:47:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:47:04,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-03-08 02:47:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:47:04,619 INFO L225 Difference]: With dead ends: 33 [2025-03-08 02:47:04,619 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 02:47:04,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-08 02:47:04,622 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:47:04,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2025-03-08 02:47:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 02:47:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-08 02:47:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-08 02:47:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-08 02:47:04,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2025-03-08 02:47:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:47:04,640 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-08 02:47:04,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 02:47:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-03-08 02:47:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:47:04,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:47:04,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:47:04,653 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 (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:47:04,842 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-08 02:47:04,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:47:04,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:47:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash -347593548, now seen corresponding path program 1 times [2025-03-08 02:47:04,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:47:04,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906751559] [2025-03-08 02:47:04,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:47:04,843 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-08 02:47:04,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:47:04,845 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-08 02:47:04,846 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-08 02:47:04,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:47:05,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:47:05,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:47:05,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:47:05,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:47:05,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:47:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:47:05,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:47:05,301 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:47:05,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906751559] [2025-03-08 02:47:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906751559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:47:05,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:47:05,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:47:05,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366542181] [2025-03-08 02:47:05,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:47:05,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:47:05,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:47:05,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:47:05,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:47:05,305 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:47:09,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:47:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:47:09,573 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2025-03-08 02:47:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:47:09,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 02:47:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:47:09,574 INFO L225 Difference]: With dead ends: 21 [2025-03-08 02:47:09,574 INFO L226 Difference]: Without dead ends: 17 [2025-03-08 02:47:09,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:47:09,575 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:47:09,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 02:47:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-08 02:47:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-08 02:47:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-08 02:47:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-08 02:47:09,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2025-03-08 02:47:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:47:09,577 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-08 02:47:09,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-08 02:47:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-03-08 02:47:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:47:09,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:47:09,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:47:09,590 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-08 02:47:09,781 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-08 02:47:09,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:47:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:47:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash -346610445, now seen corresponding path program 1 times [2025-03-08 02:47:09,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:47:09,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529667439] [2025-03-08 02:47:09,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:47:09,782 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-08 02:47:09,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:47:09,784 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-08 02:47:09,785 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-08 02:47:09,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:47:10,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:47:10,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:47:10,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:47:10,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 02:47:10,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:47:13,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 105 [2025-03-08 02:47:13,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 84 [2025-03-08 02:47:13,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 02:47:13,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 92 [2025-03-08 02:47:13,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2025-03-08 02:47:22,096 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 02:47:30,594 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 02:47:41,579 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 02:47:48,574 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_12| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse1) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_12| .cse1)) (fp.sub c_currentRoundingMode .cse2 .cse1)))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2025-03-08 02:47:52,077 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-08 02:47:52,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:47:52,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:47:52,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529667439] [2025-03-08 02:47:52,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529667439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:47:52,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:47:52,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 02:47:52,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929334046] [2025-03-08 02:47:52,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:47:52,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 02:47:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:47:52,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 02:47:52,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=47, Unknown=1, NotChecked=14, Total=90 [2025-03-08 02:47:52,079 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:47:56,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:48:00,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:48:04,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:48:07,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:48:12,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:48:16,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:48:20,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:48:24,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 02:48:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:48:24,892 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-03-08 02:48:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 02:48:24,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 02:48:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:48:24,897 INFO L225 Difference]: With dead ends: 36 [2025-03-08 02:48:24,897 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 02:48:24,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=28, Invalid=47, Unknown=1, NotChecked=14, Total=90 [2025-03-08 02:48:24,898 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:48:24,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 38 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 39 Unchecked, 32.8s Time] [2025-03-08 02:48:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 02:48:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2025-03-08 02:48:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-08 02:48:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-08 02:48:24,905 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2025-03-08 02:48:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:48:24,905 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-08 02:48:24,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:48:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-03-08 02:48:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:48:24,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:48:24,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:48:24,923 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 (4)] Forceful destruction successful, exit code 0 [2025-03-08 02:48:25,106 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-08 02:48:25,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:48:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:48:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash -38572877, now seen corresponding path program 1 times [2025-03-08 02:48:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:48:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884199910] [2025-03-08 02:48:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:48:25,107 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-08 02:48:25,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:48:25,110 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-08 02:48:25,111 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-08 02:48:25,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:48:25,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:48:25,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:48:25,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:48:25,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:48:25,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:48:25,466 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-08 02:48:25,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:48:25,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:48:25,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884199910] [2025-03-08 02:48:25,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884199910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:48:25,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:48:25,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:48:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556395022] [2025-03-08 02:48:25,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:48:25,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:48:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:48:25,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:48:25,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:48:25,468 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:48:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:48:25,509 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-08 02:48:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:48:25,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 02:48:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:48:25,510 INFO L225 Difference]: With dead ends: 32 [2025-03-08 02:48:25,510 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 02:48:25,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-08 02:48:25,511 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:48:25,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:48:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 02:48:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-08 02:48:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-08 02:48:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-08 02:48:25,513 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2025-03-08 02:48:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:48:25,513 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-08 02:48:25,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:48:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-08 02:48:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 02:48:25,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:48:25,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:48:25,524 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-08 02:48:25,714 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-08 02:48:25,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:48:25,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:48:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2112362896, now seen corresponding path program 1 times [2025-03-08 02:48:25,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:48:25,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214426803] [2025-03-08 02:48:25,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:48:25,715 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-08 02:48:25,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:48:25,717 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-08 02:48:25,717 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-08 02:48:25,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 02:48:26,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:48:26,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:48:26,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:48:26,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 02:48:26,957 INFO L279 TraceCheckSpWp]: Computing forward predicates...