./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i --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/gcd_2+newton_2_8.i -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 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:46:16,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:46:17,005 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:46:17,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:46:17,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:46:17,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:46:17,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:46:17,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:46:17,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:46:17,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:46:17,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:46:17,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:46:17,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:46:17,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:46:17,021 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:46:17,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:46:17,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:46:17,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:46:17,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:46:17,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:46:17,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:46:17,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:46:17,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:46:17,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:46:17,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:46:17,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:46:17,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:46:17,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:46:17,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:46:17,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:46:17,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:46:17,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:46:17,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:46:17,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:46:17,024 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 -> 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 [2025-02-07 21:46:17,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:46:17,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:46:17,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:46:17,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:46:17,218 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:46:17,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2025-02-07 21:46:18,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fad6b6c2/8e3c456550694159a31e6bb72268798e/FLAG9a419b2ab [2025-02-07 21:46:18,606 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:46:18,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2025-02-07 21:46:18,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fad6b6c2/8e3c456550694159a31e6bb72268798e/FLAG9a419b2ab [2025-02-07 21:46:18,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fad6b6c2/8e3c456550694159a31e6bb72268798e [2025-02-07 21:46:18,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:46:18,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:46:18,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:46:18,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:46:18,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:46:18,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:46:18" (1/1) ... [2025-02-07 21:46:18,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3748fba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:18, skipping insertion in model container [2025-02-07 21:46:18,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:46:18" (1/1) ... [2025-02-07 21:46:18,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:46:19,096 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/gcd_2+newton_2_8.i[1226,1239] [2025-02-07 21:46:19,136 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/gcd_2+newton_2_8.i[2841,2854] [2025-02-07 21:46:19,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:46:19,148 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:46:19,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/gcd_2+newton_2_8.i[1226,1239] [2025-02-07 21:46:19,168 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/gcd_2+newton_2_8.i[2841,2854] [2025-02-07 21:46:19,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:46:19,189 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:46:19,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19 WrapperNode [2025-02-07 21:46:19,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:46:19,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:46:19,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:46:19,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:46:19,202 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:46:19" (1/1) ... [2025-02-07 21:46:19,214 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:46:19" (1/1) ... [2025-02-07 21:46:19,238 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-02-07 21:46:19,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:46:19,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:46:19,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:46:19,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:46:19,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,273 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 21:46:19,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:46:19,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:46:19,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:46:19,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:46:19,291 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (1/1) ... [2025-02-07 21:46:19,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:46:19,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:46:19,332 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:46:19,334 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:46:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:46:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-02-07 21:46:19,349 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-02-07 21:46:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-07 21:46:19,349 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-07 21:46:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:46:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:46:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:46:19,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:46:19,391 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:46:19,392 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:46:19,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume false;assume false; [2025-02-07 21:46:19,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume !false; [2025-02-07 21:46:19,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-07 21:46:19,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret16#1 := main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume { :end_inline_main } true; [2025-02-07 21:46:19,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:46:19,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: main1_#res#1 := 0; [2025-02-07 21:46:19,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume 0 == __VERIFIER_assert_~cond#1; [2025-02-07 21:46:19,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-07 21:46:19,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume main1_~y~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~y~0#1 >= main1_~g~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-07 21:46:19,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume !(main1_~y~0#1 > 0); [2025-02-07 21:46:19,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: main1_#t~ret7#1 := gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;havoc gcd_test_#in~a#1, gcd_test_#in~b#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; [2025-02-07 21:46:19,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: main_#t~ret15#1 := main2_#res#1;havoc main2_#t~nondet8#1, main2_#t~ret9#1, main2_#t~ret10#1, main2_#t~ret11#1, main2_#t~ret12#1, main2_~IN~0#1, main2_~x~1#1;assume { :end_inline_main2 } true;assume -2147483648 <= main_#t~ret15#1 && main_#t~ret15#1 <= 2147483647; [2025-02-07 21:46:19,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: main_#t~ret14#1 := main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume { :end_inline_main1 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; [2025-02-07 21:46:19,498 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-07 21:46:19,498 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:46:19,504 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:46:19,504 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:46:19,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:19 BoogieIcfgContainer [2025-02-07 21:46:19,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:46:19,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:46:19,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:46:19,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:46:19,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:46:18" (1/3) ... [2025-02-07 21:46:19,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6935e1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:46:19, skipping insertion in model container [2025-02-07 21:46:19,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:19" (2/3) ... [2025-02-07 21:46:19,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6935e1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:46:19, skipping insertion in model container [2025-02-07 21:46:19,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:19" (3/3) ... [2025-02-07 21:46:19,512 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_8.i [2025-02-07 21:46:19,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:46:19,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_2_8.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-07 21:46:19,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:46:19,574 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;@6eae6390, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:46:19,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:46:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 21:46:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 21:46:19,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:46:19,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:46:19,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:46:19,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:46:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -456046533, now seen corresponding path program 1 times [2025-02-07 21:46:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:46:19,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486921650] [2025-02-07 21:46:19,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:46:19,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:46:19,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 21:46:19,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 21:46:19,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:46:19,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:46:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 21:46:19,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:46:19,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486921650] [2025-02-07 21:46:19,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486921650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:46:19,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:46:19,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:46:19,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612303067] [2025-02-07 21:46:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:46:19,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:46:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:46:19,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:46:19,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:46:19,740 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:46:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:46:19,753 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-02-07 21:46:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:46:19,754 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2025-02-07 21:46:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:46:19,757 INFO L225 Difference]: With dead ends: 43 [2025-02-07 21:46:19,758 INFO L226 Difference]: Without dead ends: 19 [2025-02-07 21:46:19,761 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:46:19,764 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:46:19,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:46:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-07 21:46:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-07 21:46:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 21:46:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-07 21:46:19,785 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 24 [2025-02-07 21:46:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:46:19,785 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-07 21:46:19,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:46:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-02-07 21:46:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 21:46:19,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:46:19,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:46:19,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:46:19,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:46:19,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:46:19,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1800864474, now seen corresponding path program 1 times [2025-02-07 21:46:19,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:46:19,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032101612] [2025-02-07 21:46:19,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:46:19,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:46:19,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 21:46:19,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 21:46:19,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:46:19,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:46:19,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:46:19,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 21:46:19,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 21:46:19,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:46:19,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:46:19,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 21:46:19,833 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:46:19,834 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:46:19,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:46:19,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:46:19,837 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:46:19,847 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:46:19,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:46:19 BoogieIcfgContainer [2025-02-07 21:46:19,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:46:19,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:46:19,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:46:19,849 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:46:19,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:19" (3/4) ... [2025-02-07 21:46:19,851 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 21:46:19,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:46:19,852 INFO L158 Benchmark]: Toolchain (without parser) took 947.20ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 60.1MB in the end (delta: 51.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 21:46:19,852 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:46:19,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.28ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 98.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:46:19,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.34ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.9MB in the end (delta: 847.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:46:19,853 INFO L158 Benchmark]: Boogie Preprocessor took 51.21ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:46:19,853 INFO L158 Benchmark]: IcfgBuilder took 214.44ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 82.0MB in the end (delta: 14.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:46:19,853 INFO L158 Benchmark]: TraceAbstraction took 342.64ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 60.1MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:46:19,853 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 142.6MB. Free memory is still 60.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:46:19,854 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.28ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 98.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.34ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.9MB in the end (delta: 847.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.21ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 214.44ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 82.0MB in the end (delta: 14.2MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 342.64ms. Allocated memory is still 142.6MB. Free memory was 81.1MB in the beginning and 60.1MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 142.6MB. Free memory is still 60.1MB. 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: 102]: 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 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticFLOAToperation at line 85, overapproximation of someBinaryArithmeticFLOAToperation at line 80, overapproximation of someBinaryArithmeticFLOAToperation at line 93, overapproximation of someBinaryArithmeticFLOAToperation at line 95. Possible FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L93] CALL, EXPR f(IN) VAL [\old(x)=110] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=110] [L93] RET, EXPR f(IN) VAL [IN=110] [L93] CALL, EXPR fp(IN) VAL [\old(x)=110] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=110] [L93] RET, EXPR fp(IN) VAL [IN=110] [L93] float x = IN - f(IN)/fp(IN); [L95] CALL, EXPR f(x) VAL [\old(x)=111] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=111] [L95] RET, EXPR f(x) VAL [IN=110, x=111] [L95] CALL, EXPR fp(x) VAL [\old(x)=111] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=111] [L95] RET, EXPR fp(x) VAL [IN=110, x=111] [L95] x = x - f(x)/fp(x) [L101] COND TRUE !(x < 0.1) VAL [IN=110] [L102] reach_error() VAL [IN=110] - UnprovableResult [Line: 27]: 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, 26 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 2, 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, 29 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, 29 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=25occurred 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, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 6/6 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:46:19,874 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/gcd_2+newton_2_8.i -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 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:46:21,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:46:21,800 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:46:21,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:46:21,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:46:21,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:46:21,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:46:21,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:46:21,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:46:21,832 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:46:21,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:46:21,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:46:21,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:46:21,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:46:21,834 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:46:21,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:46:21,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:46:21,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:46:21,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:46:21,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:46:21,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:46:21,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:46:21,836 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 -> 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 [2025-02-07 21:46:22,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:46:22,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:46:22,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:46:22,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:46:22,093 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:46:22,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2025-02-07 21:46:23,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94d551f3e/21adec9b13ad49ffa0eadc135970c654/FLAGdf7d2570b [2025-02-07 21:46:23,498 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:46:23,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2025-02-07 21:46:23,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94d551f3e/21adec9b13ad49ffa0eadc135970c654/FLAGdf7d2570b [2025-02-07 21:46:23,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94d551f3e/21adec9b13ad49ffa0eadc135970c654 [2025-02-07 21:46:23,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:46:23,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:46:23,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:46:23,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:46:23,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:46:23,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:46:23" (1/1) ... [2025-02-07 21:46:23,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e95dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:23, skipping insertion in model container [2025-02-07 21:46:23,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:46:23" (1/1) ... [2025-02-07 21:46:23,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:46:24,012 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/gcd_2+newton_2_8.i[1226,1239] [2025-02-07 21:46:24,036 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/gcd_2+newton_2_8.i[2841,2854] [2025-02-07 21:46:24,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:46:24,049 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:46:24,058 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/gcd_2+newton_2_8.i[1226,1239] [2025-02-07 21:46:24,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/gcd_2+newton_2_8.i[2841,2854] [2025-02-07 21:46:24,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:46:24,083 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:46:24,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24 WrapperNode [2025-02-07 21:46:24,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:46:24,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:46:24,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:46:24,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:46:24,089 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:46:24" (1/1) ... [2025-02-07 21:46:24,096 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:46:24" (1/1) ... [2025-02-07 21:46:24,113 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 78 [2025-02-07 21:46:24,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:46:24,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:46:24,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:46:24,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:46:24,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,137 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 21:46:24,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:46:24,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:46:24,155 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:46:24,155 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:46:24,156 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (1/1) ... [2025-02-07 21:46:24,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:46:24,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:46:24,180 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:46:24,183 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:46:24,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:46:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 21:46:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 21:46:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-02-07 21:46:24,203 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-02-07 21:46:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-07 21:46:24,203 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-07 21:46:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:46:24,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:46:24,260 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:46:24,261 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:46:30,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume false;assume false; [2025-02-07 21:46:30,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume !false; [2025-02-07 21:46:30,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-07 21:46:30,709 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret16#1 := main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume { :end_inline_main } true; [2025-02-07 21:46:30,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:46:30,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: main1_#res#1 := 0bv32; [2025-02-07 21:46:30,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume 0bv32 == __VERIFIER_assert_~cond#1; [2025-02-07 21:46:30,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume !(0bv32 == __VERIFIER_assert_~cond#1); [2025-02-07 21:46:30,710 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume ~bvsgt~32(~sign_extend~32~8(main1_~y~0#1), 0bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge~32(~sign_extend~32~8(main1_~y~0#1), ~sign_extend~32~8(main1_~g~0#1)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-07 21:46:30,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume !~bvsgt~32(~sign_extend~32~8(main1_~y~0#1), 0bv32); [2025-02-07 21:46:30,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: main1_#t~ret7#1 := gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;havoc gcd_test_#in~a#1, gcd_test_#in~b#1;assume { :end_inline_gcd_test } true;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1; [2025-02-07 21:46:30,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: main_#t~ret15#1 := main2_#res#1;havoc main2_#t~nondet8#1, main2_#t~ret9#1, main2_#t~ret10#1, main2_#t~ret11#1, main2_#t~ret12#1, main2_~IN~0#1, main2_~x~1#1;assume { :end_inline_main2 } true; [2025-02-07 21:46:30,711 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: main_#t~ret14#1 := main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume { :end_inline_main1 } true; [2025-02-07 21:46:34,803 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-07 21:46:34,803 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:46:34,813 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:46:34,813 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:46:34,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:34 BoogieIcfgContainer [2025-02-07 21:46:34,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:46:34,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:46:34,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:46:34,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:46:34,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:46:23" (1/3) ... [2025-02-07 21:46:34,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416544de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:46:34, skipping insertion in model container [2025-02-07 21:46:34,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:24" (2/3) ... [2025-02-07 21:46:34,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416544de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:46:34, skipping insertion in model container [2025-02-07 21:46:34,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:34" (3/3) ... [2025-02-07 21:46:34,822 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_8.i [2025-02-07 21:46:34,830 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:46:34,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_2_8.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-07 21:46:34,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:46:34,874 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;@7dd3f02e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:46:34,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:46:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 21:46:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 21:46:34,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:46:34,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:46:34,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:46:34,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:46:34,886 INFO L85 PathProgramCache]: Analyzing trace with hash -456046533, now seen corresponding path program 1 times [2025-02-07 21:46:34,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 21:46:34,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732188179] [2025-02-07 21:46:34,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:46:34,893 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:46:34,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 21:46:34,896 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:46:34,897 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:46:34,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 21:46:36,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 21:46:36,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:46:36,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:46:36,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 21:46:36,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:46:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 21:46:36,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:46:36,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 21:46:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732188179] [2025-02-07 21:46:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732188179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:46:36,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:46:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:46:36,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244758478] [2025-02-07 21:46:36,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:46:36,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:46:36,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 21:46:36,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:46:36,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:46:36,792 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:46:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:46:36,801 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-02-07 21:46:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:46:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2025-02-07 21:46:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:46:36,805 INFO L225 Difference]: With dead ends: 43 [2025-02-07 21:46:36,805 INFO L226 Difference]: Without dead ends: 19 [2025-02-07 21:46:36,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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:46:36,808 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:46:36,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:46:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-07 21:46:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-07 21:46:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 21:46:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-07 21:46:36,828 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 24 [2025-02-07 21:46:36,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:46:36,828 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-07 21:46:36,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 21:46:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-02-07 21:46:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 21:46:36,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:46:36,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:46:36,877 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:46:37,033 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:46:37,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:46:37,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:46:37,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1800864474, now seen corresponding path program 1 times [2025-02-07 21:46:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 21:46:37,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045007854] [2025-02-07 21:46:37,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:46:37,035 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:46:37,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 21:46:37,037 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:46:37,039 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:46:37,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 21:46:53,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 21:46:53,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:46:53,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:46:53,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:46:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.