./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f3d0efaf33b93df425f185e68aa4bb5fd862b42784228ced2cb70c663695e18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:58:17,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:58:17,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:58:17,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:58:17,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:58:17,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:58:17,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:58:17,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:58:17,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:58:17,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:58:17,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:58:17,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:58:17,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:58:17,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:58:17,312 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:58:17,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:58:17,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:58:17,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:58:17,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:58:17,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:58:17,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:58:17,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:58:17,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:58:17,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:58:17,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:58:17,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:58:17,314 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f3d0efaf33b93df425f185e68aa4bb5fd862b42784228ced2cb70c663695e18 [2025-02-07 21:58:17,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:58:17,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:58:17,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:58:17,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:58:17,562 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:58:17,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c [2025-02-07 21:58:18,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f950559e/917f17a7554e4670b354d5cd086624d7/FLAG946210093 [2025-02-07 21:58:18,889 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:58:18,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c [2025-02-07 21:58:18,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f950559e/917f17a7554e4670b354d5cd086624d7/FLAG946210093 [2025-02-07 21:58:18,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f950559e/917f17a7554e4670b354d5cd086624d7 [2025-02-07 21:58:18,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:58:18,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:58:18,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:58:18,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:58:18,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:58:18,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:58:18" (1/1) ... [2025-02-07 21:58:18,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e324918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:18, skipping insertion in model container [2025-02-07 21:58:18,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:58:18" (1/1) ... [2025-02-07 21:58:18,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:58:19,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c[1996,2009] [2025-02-07 21:58:19,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c[2390,2403] [2025-02-07 21:58:19,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:58:19,060 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:58:19,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c[1996,2009] [2025-02-07 21:58:19,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c[2390,2403] [2025-02-07 21:58:19,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:58:19,100 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:58:19,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19 WrapperNode [2025-02-07 21:58:19,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:58:19,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:58:19,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:58:19,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:58:19,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,137 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 211 [2025-02-07 21:58:19,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:58:19,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:58:19,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:58:19,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:58:19,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,164 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 21:58:19,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:58:19,181 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:58:19,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:58:19,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:58:19,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (1/1) ... [2025-02-07 21:58:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:58:19,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:58:19,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:58:19,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:58:19,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:58:19,230 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-07 21:58:19,230 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-07 21:58:19,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:58:19,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:58:19,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:58:19,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 21:58:19,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 21:58:19,293 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:58:19,294 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:58:19,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: main2_#t~ret26#1 := addflt_#res#1;havoc addflt_#t~bitwise9#1, addflt_#t~bitwise10#1, addflt_#t~bitwise11#1, addflt_#t~bitwise12#1, addflt_#t~bitwise13#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;havoc addflt_#in~a#1, addflt_#in~b#1;assume { :end_inline_addflt } true;main2_~r_add~0#1 := main2_#t~ret26#1;havoc main2_#t~ret26#1; [2025-02-07 21:58:19,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: main2_~tmp___8~0#1 := main2_~tmp___7~0#1; [2025-02-07 21:58:19,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: main2_~tmp___4~0#1 := main2_~tmp___3~0#1; [2025-02-07 21:58:19,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L374: assume main2_~r_add~0#1 % 4294967296 < main2_~b~0#1 % 4294967296;main2_~tmp___8~0#1 := -1; [2025-02-07 21:58:19,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L374: assume !(main2_~r_add~0#1 % 4294967296 < main2_~b~0#1 % 4294967296); [2025-02-07 21:58:19,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L337: assume main2_~r_add~0#1 % 4294967296 < main2_~b~0#1 % 4294967296;main2_~tmp___4~0#1 := -1; [2025-02-07 21:58:19,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L337: assume !(main2_~r_add~0#1 % 4294967296 < main2_~b~0#1 % 4294967296); [2025-02-07 21:58:19,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: SUMMARY for call __VERIFIER_assert(main2_~tmp___9~0#1); srcloc: null [2025-02-07 21:58:19,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret30#1 := main_#res#1;havoc main_#t~nondet27#1, main_#t~ret28#1, main_#t~ret29#1;assume { :end_inline_main } true; [2025-02-07 21:58:19,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:58:19,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: main_#t~ret28#1 := main1_#res#1;havoc main1_#t~nondet2#1, main1_~IN~0#1, main1_~x~0#1, main1_~result~0#1;assume { :end_inline_main1 } true;assume -2147483648 <= main_#t~ret28#1 && main_#t~ret28#1 <= 2147483647; [2025-02-07 21:58:19,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: assume 0 == main2_~tmp___6~0#1;main2_~tmp___9~0#1 := 1; [2025-02-07 21:58:19,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: assume !(0 == main2_~tmp___6~0#1); [2025-02-07 21:58:19,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: assume 0 == main2_~sb~0#1; [2025-02-07 21:58:19,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: assume !(0 == main2_~sb~0#1); [2025-02-07 21:58:19,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume main2_~sa~0#1 > 0; [2025-02-07 21:58:19,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume !(main2_~sa~0#1 > 0); [2025-02-07 21:58:19,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: assume 0 == main2_~tmp___8~0#1;main2_~tmp___9~0#1 := 1; [2025-02-07 21:58:19,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: assume !(0 == main2_~tmp___8~0#1);main2_~tmp___9~0#1 := 0; [2025-02-07 21:58:19,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L335: SUMMARY for call __VERIFIER_assert((if main2_~tmp___2~0#1 >= 0 then 1 else 0)); srcloc: null [2025-02-07 21:58:19,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: main2_~__retres23~0#1 := 0;main2_#res#1 := main2_~__retres23~0#1; [2025-02-07 21:58:19,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L364: assume main2_~r_add~0#1 % 4294967296 > main2_~a~0#1 % 4294967296;main2_~tmp___5~0#1 := 1; [2025-02-07 21:58:19,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L364: assume !(main2_~r_add~0#1 % 4294967296 > main2_~a~0#1 % 4294967296);main2_~tmp___5~0#1 := 0; [2025-02-07 21:58:19,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: assume main2_~r_add~0#1 % 4294967296 > main2_~a~0#1 % 4294967296;main2_~tmp___1~0#1 := 1; [2025-02-07 21:58:19,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: assume !(main2_~r_add~0#1 % 4294967296 > main2_~a~0#1 % 4294967296);main2_~tmp___1~0#1 := 0; [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: assume 0 == main2_~sa~0#1; [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: assume !(0 == main2_~sa~0#1); [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume main2_~sb~0#1 > 0; [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume !(main2_~sb~0#1 > 0); [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: SUMMARY for call __VERIFIER_assert((if main2_~tmp___4~0#1 >= 0 then 1 else 0)); srcloc: null [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: assume main2_~r_add~0#1 % 4294967296 > main2_~b~0#1 % 4294967296;main2_~tmp___7~0#1 := 1; [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: assume !(main2_~r_add~0#1 % 4294967296 > main2_~b~0#1 % 4294967296);main2_~tmp___7~0#1 := 0; [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: main_#t~ret29#1 := main2_#res#1;havoc main2_#t~nondet19#1, main2_#t~nondet20#1, main2_#t~nondet21#1, main2_#t~nondet22#1, main2_#t~ret23#1, main2_#t~ret24#1, main2_#t~ret25#1, main2_#t~ret26#1, main2_~a~0#1, main2_~ma~2#1, main2_~ea~2#1, main2_~b~0#1, main2_~mb~2#1, main2_~eb~2#1, main2_~r_add~0#1, main2_~zero~0#1, main2_~sa~0#1, main2_~sb~0#1, main2_~tmp~2#1, main2_~tmp___0~0#1, main2_~tmp___1~0#1, main2_~tmp___2~0#1, main2_~tmp___3~0#1, main2_~tmp___4~0#1, main2_~tmp___5~0#1, main2_~tmp___6~0#1, main2_~tmp___7~0#1, main2_~tmp___8~0#1, main2_~tmp___9~0#1, main2_~__retres23~0#1;assume { :end_inline_main2 } true;assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647; [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L340: assume main2_~r_add~0#1 % 4294967296 > main2_~b~0#1 % 4294967296;main2_~tmp___3~0#1 := 1; [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L340: assume !(main2_~r_add~0#1 % 4294967296 > main2_~b~0#1 % 4294967296);main2_~tmp___3~0#1 := 0; [2025-02-07 21:58:19,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: main2_~tmp___6~0#1 := main2_~tmp___5~0#1; [2025-02-07 21:58:19,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: main2_~tmp___2~0#1 := main2_~tmp___1~0#1; [2025-02-07 21:58:19,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361: assume main2_~r_add~0#1 % 4294967296 < main2_~a~0#1 % 4294967296;main2_~tmp___6~0#1 := -1; [2025-02-07 21:58:19,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361: assume !(main2_~r_add~0#1 % 4294967296 < main2_~a~0#1 % 4294967296); [2025-02-07 21:58:19,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume main2_~r_add~0#1 % 4294967296 < main2_~a~0#1 % 4294967296;main2_~tmp___2~0#1 := -1; [2025-02-07 21:58:19,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume !(main2_~r_add~0#1 % 4294967296 < main2_~a~0#1 % 4294967296); [2025-02-07 21:58:19,625 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-02-07 21:58:19,625 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:58:19,651 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:58:19,653 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-07 21:58:19,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:58:19 BoogieIcfgContainer [2025-02-07 21:58:19,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:58:19,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:58:19,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:58:19,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:58:19,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:58:18" (1/3) ... [2025-02-07 21:58:19,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a031e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:58:19, skipping insertion in model container [2025-02-07 21:58:19,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:19" (2/3) ... [2025-02-07 21:58:19,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a031e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:58:19, skipping insertion in model container [2025-02-07 21:58:19,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:58:19" (3/3) ... [2025-02-07 21:58:19,660 INFO L128 eAbstractionObserver]: Analyzing ICFG square_1+soft_float_1-2a.c.cil.c [2025-02-07 21:58:19,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:58:19,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG square_1+soft_float_1-2a.c.cil.c that has 3 procedures, 81 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-07 21:58:19,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:58:19,719 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;@50178a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:58:19,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:58:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 72 states have internal predecessors, (102), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:58:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 21:58:19,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:58:19,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 21:58:19,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:58:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:58:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1480424138, now seen corresponding path program 1 times [2025-02-07 21:58:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:58:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422466920] [2025-02-07 21:58:19,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:58:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:58:19,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 21:58:19,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 21:58:19,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:58:19,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:58:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:58:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:58:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422466920] [2025-02-07 21:58:19,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422466920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:58:19,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:58:19,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:58:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140060326] [2025-02-07 21:58:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:58:19,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:58:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:58:19,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:58:19,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:58:19,832 INFO L87 Difference]: Start difference. First operand has 80 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 72 states have internal predecessors, (102), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-07 21:58:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:58:19,849 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2025-02-07 21:58:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:58:19,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-07 21:58:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:58:19,853 INFO L225 Difference]: With dead ends: 98 [2025-02-07 21:58:19,853 INFO L226 Difference]: Without dead ends: 7 [2025-02-07 21:58:19,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:58:19,857 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:58:19,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:58:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-02-07 21:58:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-02-07 21:58:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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-02-07 21:58:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6 transitions. [2025-02-07 21:58:19,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 6 transitions. Word has length 6 [2025-02-07 21:58:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:58:19,879 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 6 transitions. [2025-02-07 21:58:19,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-07 21:58:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2025-02-07 21:58:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 21:58:19,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:58:19,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 21:58:19,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:58:19,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:58:19,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:58:19,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1480453929, now seen corresponding path program 1 times [2025-02-07 21:58:19,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:58:19,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860877181] [2025-02-07 21:58:19,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:58:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:58:19,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 21:58:19,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 21:58:19,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:58:19,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:58:19,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:58:19,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 21:58:19,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 21:58:19,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:58:19,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:58:19,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 21:58:19,920 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:58:19,921 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:58:19,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:58:19,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:58:19,925 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:58:19,934 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:58:19,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:58:19 BoogieIcfgContainer [2025-02-07 21:58:19,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:58:19,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:58:19,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:58:19,939 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:58:19,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:58:19" (3/4) ... [2025-02-07 21:58:19,941 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 21:58:19,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:58:19,942 INFO L158 Benchmark]: Toolchain (without parser) took 1031.83ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 68.8MB in the end (delta: 64.4MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-07 21:58:19,943 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:58:19,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.51ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 118.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:58:19,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.72ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 116.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:58:19,944 INFO L158 Benchmark]: Boogie Preprocessor took 41.84ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 114.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:58:19,944 INFO L158 Benchmark]: IcfgBuilder took 472.53ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 88.6MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 21:58:19,945 INFO L158 Benchmark]: TraceAbstraction took 283.80ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 68.8MB in the end (delta: 19.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 21:58:19,945 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 167.8MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:58:19,946 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.48ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.51ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 118.2MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.72ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 116.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.84ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 114.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 472.53ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 88.6MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 283.80ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 68.8MB in the end (delta: 19.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 167.8MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 48]: 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 40, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L403] COND TRUE __VERIFIER_nondet_int() [L404] CALL main1() [L39] float IN = __VERIFIER_nondet_float(); [L40] CALL assume_abort_if_not(IN >= 0.0f && IN < 1.0f) [L34] COND FALSE !(!cond) [L40] RET assume_abort_if_not(IN >= 0.0f && IN < 1.0f) [L42] float x = IN; [L44-L45] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; [L47] COND TRUE !(result >= 0.0f && result < 1.39f) [L48] reach_error() - UnprovableResult [Line: 61]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 25 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 21:58:19,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f3d0efaf33b93df425f185e68aa4bb5fd862b42784228ced2cb70c663695e18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:58:21,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:58:22,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 21:58:22,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:58:22,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:58:22,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:58:22,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:58:22,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:58:22,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:58:22,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:58:22,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:58:22,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:58:22,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:58:22,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:58:22,062 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:58:22,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:58:22,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:58:22,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:58:22,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:58:22,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:58:22,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:58:22,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:58:22,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:58:22,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:58:22,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:58:22,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:58:22,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:58:22,065 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f3d0efaf33b93df425f185e68aa4bb5fd862b42784228ced2cb70c663695e18 [2025-02-07 21:58:22,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:58:22,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:58:22,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:58:22,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:58:22,309 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:58:22,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c [2025-02-07 21:58:23,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a13b0378b/ef492819f0e9402f8deddad17c5d8681/FLAG80027e82b [2025-02-07 21:58:23,682 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:58:23,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c [2025-02-07 21:58:23,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a13b0378b/ef492819f0e9402f8deddad17c5d8681/FLAG80027e82b [2025-02-07 21:58:24,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a13b0378b/ef492819f0e9402f8deddad17c5d8681 [2025-02-07 21:58:24,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:58:24,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:58:24,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:58:24,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:58:24,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:58:24,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7394cde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24, skipping insertion in model container [2025-02-07 21:58:24,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:58:24,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c[1996,2009] [2025-02-07 21:58:24,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c[2390,2403] [2025-02-07 21:58:24,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:58:24,223 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:58:24,234 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c[1996,2009] [2025-02-07 21:58:24,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/square_1+soft_float_1-2a.c.cil.c[2390,2403] [2025-02-07 21:58:24,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:58:24,289 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:58:24,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24 WrapperNode [2025-02-07 21:58:24,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:58:24,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:58:24,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:58:24,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:58:24,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,329 INFO L138 Inliner]: procedures = 28, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2025-02-07 21:58:24,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:58:24,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:58:24,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:58:24,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:58:24,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,359 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 21:58:24,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:58:24,384 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:58:24,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:58:24,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:58:24,385 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (1/1) ... [2025-02-07 21:58:24,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:58:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:58:24,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:58:24,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:58:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:58:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 21:58:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-07 21:58:24,433 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-07 21:58:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:58:24,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:58:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 21:58:24,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 21:58:24,500 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:58:24,502 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:58:29,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: main2_#t~ret14#1 := addflt_#res#1;havoc addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;havoc addflt_#in~a#1, addflt_#in~b#1;assume { :end_inline_addflt } true;main2_~r_add~0#1 := main2_#t~ret14#1;havoc main2_#t~ret14#1; [2025-02-07 21:58:29,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: main2_~tmp___8~0#1 := main2_~tmp___7~0#1; [2025-02-07 21:58:29,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: main2_~tmp___4~0#1 := main2_~tmp___3~0#1; [2025-02-07 21:58:29,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L374: assume ~bvult~32(main2_~r_add~0#1, main2_~b~0#1);main2_~tmp___8~0#1 := 4294967295bv32; [2025-02-07 21:58:29,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L374: assume !~bvult~32(main2_~r_add~0#1, main2_~b~0#1); [2025-02-07 21:58:29,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L337: assume ~bvult~32(main2_~r_add~0#1, main2_~b~0#1);main2_~tmp___4~0#1 := 4294967295bv32; [2025-02-07 21:58:29,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L337: assume !~bvult~32(main2_~r_add~0#1, main2_~b~0#1); [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: SUMMARY for call __VERIFIER_assert(main2_~tmp___9~0#1); srcloc: null [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret18#1 := main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume { :end_inline_main } true; [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: main_#t~ret16#1 := main1_#res#1;havoc main1_#t~nondet2#1, main1_~IN~0#1, main1_~x~0#1, main1_~result~0#1;assume { :end_inline_main1 } true; [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: assume 0bv32 == main2_~tmp___6~0#1;main2_~tmp___9~0#1 := 1bv32; [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: assume !(0bv32 == main2_~tmp___6~0#1); [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: assume 0bv32 == main2_~sb~0#1; [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: assume !(0bv32 == main2_~sb~0#1); [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume ~bvsgt~32(main2_~sa~0#1, 0bv32); [2025-02-07 21:58:29,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: assume !~bvsgt~32(main2_~sa~0#1, 0bv32); [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: assume 0bv32 == main2_~tmp___8~0#1;main2_~tmp___9~0#1 := 1bv32; [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: assume !(0bv32 == main2_~tmp___8~0#1);main2_~tmp___9~0#1 := 0bv32; [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L335: SUMMARY for call __VERIFIER_assert((if ~bvsge~32(main2_~tmp___2~0#1, 0bv32) then 1bv32 else 0bv32)); srcloc: null [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: main2_~__retres23~0#1 := 0bv32;main2_#res#1 := main2_~__retres23~0#1; [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L364: assume ~bvugt~32(main2_~r_add~0#1, main2_~a~0#1);main2_~tmp___5~0#1 := 1bv32; [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L364: assume !~bvugt~32(main2_~r_add~0#1, main2_~a~0#1);main2_~tmp___5~0#1 := 0bv32; [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: assume ~bvugt~32(main2_~r_add~0#1, main2_~a~0#1);main2_~tmp___1~0#1 := 1bv32; [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: assume !~bvugt~32(main2_~r_add~0#1, main2_~a~0#1);main2_~tmp___1~0#1 := 0bv32; [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: assume 0bv32 == main2_~sa~0#1; [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: assume !(0bv32 == main2_~sa~0#1); [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume ~bvsgt~32(main2_~sb~0#1, 0bv32); [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: assume !~bvsgt~32(main2_~sb~0#1, 0bv32); [2025-02-07 21:58:29,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: SUMMARY for call __VERIFIER_assert((if ~bvsge~32(main2_~tmp___4~0#1, 0bv32) then 1bv32 else 0bv32)); srcloc: null [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: assume ~bvugt~32(main2_~r_add~0#1, main2_~b~0#1);main2_~tmp___7~0#1 := 1bv32; [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: assume !~bvugt~32(main2_~r_add~0#1, main2_~b~0#1);main2_~tmp___7~0#1 := 0bv32; [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: main_#t~ret17#1 := main2_#res#1;havoc main2_#t~nondet7#1, main2_#t~nondet8#1, main2_#t~nondet9#1, main2_#t~nondet10#1, main2_#t~ret11#1, main2_#t~ret12#1, main2_#t~ret13#1, main2_#t~ret14#1, main2_~a~0#1, main2_~ma~2#1, main2_~ea~2#1, main2_~b~0#1, main2_~mb~2#1, main2_~eb~2#1, main2_~r_add~0#1, main2_~zero~0#1, main2_~sa~0#1, main2_~sb~0#1, main2_~tmp~2#1, main2_~tmp___0~0#1, main2_~tmp___1~0#1, main2_~tmp___2~0#1, main2_~tmp___3~0#1, main2_~tmp___4~0#1, main2_~tmp___5~0#1, main2_~tmp___6~0#1, main2_~tmp___7~0#1, main2_~tmp___8~0#1, main2_~tmp___9~0#1, main2_~__retres23~0#1;assume { :end_inline_main2 } true; [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L340: assume ~bvugt~32(main2_~r_add~0#1, main2_~b~0#1);main2_~tmp___3~0#1 := 1bv32; [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L340: assume !~bvugt~32(main2_~r_add~0#1, main2_~b~0#1);main2_~tmp___3~0#1 := 0bv32; [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: main2_~tmp___6~0#1 := main2_~tmp___5~0#1; [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: main2_~tmp___2~0#1 := main2_~tmp___1~0#1; [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361: assume ~bvult~32(main2_~r_add~0#1, main2_~a~0#1);main2_~tmp___6~0#1 := 4294967295bv32; [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L361: assume !~bvult~32(main2_~r_add~0#1, main2_~a~0#1); [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume ~bvult~32(main2_~r_add~0#1, main2_~a~0#1);main2_~tmp___2~0#1 := 4294967295bv32; [2025-02-07 21:58:29,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L324: assume !~bvult~32(main2_~r_add~0#1, main2_~a~0#1); [2025-02-07 21:58:29,340 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-02-07 21:58:29,340 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:58:29,346 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:58:29,346 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:58:29,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:58:29 BoogieIcfgContainer [2025-02-07 21:58:29,347 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:58:29,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:58:29,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:58:29,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:58:29,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:58:24" (1/3) ... [2025-02-07 21:58:29,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4bf16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:58:29, skipping insertion in model container [2025-02-07 21:58:29,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:58:24" (2/3) ... [2025-02-07 21:58:29,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4bf16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:58:29, skipping insertion in model container [2025-02-07 21:58:29,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:58:29" (3/3) ... [2025-02-07 21:58:29,353 INFO L128 eAbstractionObserver]: Analyzing ICFG square_1+soft_float_1-2a.c.cil.c [2025-02-07 21:58:29,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:58:29,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG square_1+soft_float_1-2a.c.cil.c that has 3 procedures, 57 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-07 21:58:29,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:58:29,408 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;@4932ab0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:58:29,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:58:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 48 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:58:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 21:58:29,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:58:29,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 21:58:29,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:58:29,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:58:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash 208335529, now seen corresponding path program 1 times [2025-02-07 21:58:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 21:58:29,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142174215] [2025-02-07 21:58:29,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:58:29,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 21:58:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 21:58:29,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 21:58:29,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-07 21:58:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 21:58:29,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 21:58:29,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:58:29,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:58:29,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 21:58:29,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:58:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:58:29,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:58:29,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 21:58:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142174215] [2025-02-07 21:58:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142174215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:58:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:58:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:58:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981597594] [2025-02-07 21:58:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:58:29,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:58:29,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 21:58:29,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:58:29,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:58:29,842 INFO L87 Difference]: Start difference. First operand has 56 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 48 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-07 21:58:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:58:29,852 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2025-02-07 21:58:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:58:29,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-07 21:58:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:58:29,856 INFO L225 Difference]: With dead ends: 74 [2025-02-07 21:58:29,856 INFO L226 Difference]: Without dead ends: 7 [2025-02-07 21:58:29,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:58:29,860 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:58:29,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:58:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-02-07 21:58:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-02-07 21:58:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 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-02-07 21:58:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6 transitions. [2025-02-07 21:58:29,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 6 transitions. Word has length 6 [2025-02-07 21:58:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:58:29,877 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 6 transitions. [2025-02-07 21:58:29,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-07 21:58:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2025-02-07 21:58:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 21:58:29,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:58:29,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 21:58:29,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-07 21:58:30,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 21:58:30,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:58:30,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:58:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash 208365320, now seen corresponding path program 1 times [2025-02-07 21:58:30,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 21:58:30,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392854241] [2025-02-07 21:58:30,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:58:30,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 21:58:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 21:58:30,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 21:58:30,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-07 21:58:30,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 21:58:44,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 21:58:44,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:58:44,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:58:44,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:58:44,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 21:59:09,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 21:59:09,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:59:09,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:59:09,797 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-07 21:59:09,797 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:59:09,798 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:59:09,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:59:09,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-07 21:59:10,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 21:59:10,003 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:59:10,015 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:59:10,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:59:10 BoogieIcfgContainer [2025-02-07 21:59:10,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:59:10,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:59:10,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:59:10,020 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:59:10,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:58:29" (3/4) ... [2025-02-07 21:59:10,022 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 21:59:10,050 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-02-07 21:59:10,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:59:10,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:59:10,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:59:10,086 INFO L158 Benchmark]: Toolchain (without parser) took 46061.60ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 49.9MB in the end (delta: 26.0MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2025-02-07 21:59:10,086 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:59:10,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.01ms. Allocated memory is still 100.7MB. Free memory was 75.7MB in the beginning and 60.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:59:10,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.72ms. Allocated memory is still 100.7MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:59:10,089 INFO L158 Benchmark]: Boogie Preprocessor took 50.89ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 56.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:59:10,089 INFO L158 Benchmark]: IcfgBuilder took 4962.86ms. Allocated memory is still 100.7MB. Free memory was 56.7MB in the beginning and 74.3MB in the end (delta: -17.6MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2025-02-07 21:59:10,089 INFO L158 Benchmark]: TraceAbstraction took 40670.89ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 54.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:59:10,089 INFO L158 Benchmark]: Witness Printer took 65.32ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 49.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:59:10,090 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.01ms. Allocated memory is still 100.7MB. Free memory was 75.7MB in the beginning and 60.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.72ms. Allocated memory is still 100.7MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.89ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 56.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 4962.86ms. Allocated memory is still 100.7MB. Free memory was 56.7MB in the beginning and 74.3MB in the end (delta: -17.6MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * TraceAbstraction took 40670.89ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 54.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 65.32ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 49.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 48]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L403] COND TRUE __VERIFIER_nondet_int() [L404] CALL main1() [L39] float IN = __VERIFIER_nondet_float(); [L40] CALL assume_abort_if_not(IN >= 0.0f && IN < 1.0f) [L34] COND FALSE !(!cond) [L40] RET assume_abort_if_not(IN >= 0.0f && IN < 1.0f) [L42] float x = IN; [L44-L45] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; VAL [result=1.3906031847000122] [L47] COND TRUE !(result >= 0.0f && result < 1.39f) [L48] reach_error() - UnprovableResult [Line: 61]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 40.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 25 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 14.5s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 19 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 proved your program to be incorrect! [2025-02-07 21:59:10,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE