./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_3+newton_2_7.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_3+newton_2_7.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 a7443921b0608d3c2ff1c61e12bf7cf129e5c1aecf22f0fb9785817b90c162e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:48:21,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:48:21,534 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:48:21,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:48:21,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:48:21,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:48:21,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:48:21,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:48:21,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:48:21,562 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:48:21,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:48:21,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:48:21,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:48:21,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:48:21,562 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:48:21,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:48:21,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:48:21,563 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:48:21,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:48:21,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:48:21,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:48:21,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:48:21,565 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 -> a7443921b0608d3c2ff1c61e12bf7cf129e5c1aecf22f0fb9785817b90c162e7 [2025-02-07 21:48:21,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:48:21,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:48:21,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:48:21,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:48:21,741 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:48:21,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_2_7.i [2025-02-07 21:48:22,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afc5c3a73/d4c6ae2bfa734bcfa86023c7e448f93a/FLAG95130a112 [2025-02-07 21:48:23,073 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:48:23,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i [2025-02-07 21:48:23,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afc5c3a73/d4c6ae2bfa734bcfa86023c7e448f93a/FLAG95130a112 [2025-02-07 21:48:23,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afc5c3a73/d4c6ae2bfa734bcfa86023c7e448f93a [2025-02-07 21:48:23,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:48:23,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:48:23,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:48:23,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:48:23,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:48:23,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f70e6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23, skipping insertion in model container [2025-02-07 21:48:23,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:48:23,379 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_3+newton_2_7.i[1226,1239] [2025-02-07 21:48:23,419 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_3+newton_2_7.i[2841,2854] [2025-02-07 21:48:23,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:48:23,434 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:48:23,442 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_3+newton_2_7.i[1226,1239] [2025-02-07 21:48:23,451 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_3+newton_2_7.i[2841,2854] [2025-02-07 21:48:23,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:48:23,466 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:48:23,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23 WrapperNode [2025-02-07 21:48:23,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:48:23,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:48:23,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:48:23,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:48:23,475 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:48:23" (1/1) ... [2025-02-07 21:48:23,480 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:48:23" (1/1) ... [2025-02-07 21:48:23,495 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-02-07 21:48:23,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:48:23,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:48:23,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:48:23,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:48:23,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,522 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:48:23,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:48:23,535 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:48:23,535 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:48:23,535 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:48:23,536 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (1/1) ... [2025-02-07 21:48:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:48:23,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:48:23,576 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:48:23,585 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:48:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:48:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-02-07 21:48:23,602 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-02-07 21:48:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-07 21:48:23,602 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-07 21:48:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:48:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:48:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:48:23,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:48:23,660 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:48:23,662 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:48:23,772 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume false;assume false; [2025-02-07 21:48:23,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume !false; [2025-02-07 21:48:23,773 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:48:23,773 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:48:23,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:48:23,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: main1_#res#1 := 0; [2025-02-07 21:48:23,773 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume 0 == __VERIFIER_assert_~cond#1; [2025-02-07 21:48:23,774 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-07 21:48:23,774 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume main1_~x~0#1 > 0;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~x~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:48:23,774 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume !(main1_~x~0#1 > 0); [2025-02-07 21:48:23,774 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:48:23,774 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:48:23,774 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:48:23,793 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-07 21:48:23,793 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:48:23,798 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:48:23,798 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:48:23,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:48:23 BoogieIcfgContainer [2025-02-07 21:48:23,799 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:48:23,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:48:23,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:48:23,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:48:23,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:48:23" (1/3) ... [2025-02-07 21:48:23,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27130afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:48:23, skipping insertion in model container [2025-02-07 21:48:23,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:23" (2/3) ... [2025-02-07 21:48:23,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27130afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:48:23, skipping insertion in model container [2025-02-07 21:48:23,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:48:23" (3/3) ... [2025-02-07 21:48:23,805 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_7.i [2025-02-07 21:48:23,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:48:23,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_3+newton_2_7.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-07 21:48:23,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:48:23,853 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;@46bbb75c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:48:23,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:48:23,855 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:48:23,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 21:48:23,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:48:23,859 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:48:23,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:48:23,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:48:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash -456046533, now seen corresponding path program 1 times [2025-02-07 21:48:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:48:23,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141455335] [2025-02-07 21:48:23,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:48:23,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:48:23,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 21:48:23,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 21:48:23,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:48:23,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:48:23,944 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:48:23,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:48:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141455335] [2025-02-07 21:48:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141455335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:48:23,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:48:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:48:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218609469] [2025-02-07 21:48:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:48:23,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:48:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:48:23,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:48:23,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:48:23,960 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:48:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:48:23,969 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-02-07 21:48:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:48:23,970 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:48:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:48:23,973 INFO L225 Difference]: With dead ends: 43 [2025-02-07 21:48:23,974 INFO L226 Difference]: Without dead ends: 19 [2025-02-07 21:48:23,975 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:48:23,977 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:48:23,977 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:48:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-07 21:48:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-07 21:48:23,997 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:48:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-07 21:48:24,000 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 24 [2025-02-07 21:48:24,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:48:24,000 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-07 21:48:24,000 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:48:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-02-07 21:48:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 21:48:24,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:48:24,002 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:48:24,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:48:24,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:48:24,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:48:24,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1800864474, now seen corresponding path program 1 times [2025-02-07 21:48:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:48:24,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447196637] [2025-02-07 21:48:24,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:48:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:48:24,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 21:48:24,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 21:48:24,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:48:24,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:48:24,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:48:24,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 21:48:24,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 21:48:24,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:48:24,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:48:24,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 21:48:24,059 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:48:24,060 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:48:24,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:48:24,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:48:24,064 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:48:24,078 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:48:24,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:48:24 BoogieIcfgContainer [2025-02-07 21:48:24,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:48:24,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:48:24,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:48:24,082 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:48:24,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:48:23" (3/4) ... [2025-02-07 21:48:24,084 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 21:48:24,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:48:24,086 INFO L158 Benchmark]: Toolchain (without parser) took 958.60ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 71.6MB in the end (delta: 51.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 21:48:24,086 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:48:24,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.49ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 110.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:48:24,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.02ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:48:24,087 INFO L158 Benchmark]: Boogie Preprocessor took 37.43ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:48:24,087 INFO L158 Benchmark]: IcfgBuilder took 263.62ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 93.3MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:48:24,088 INFO L158 Benchmark]: TraceAbstraction took 280.36ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 71.6MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:48:24,088 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 167.8MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:48:24,089 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.17ms. Allocated memory is still 209.7MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.49ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 110.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.02ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.43ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 107.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 263.62ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 93.3MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 280.36ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 71.6MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 167.8MB. Free memory is still 71.6MB. 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 95, overapproximation of someBinaryArithmeticFLOAToperation at line 85, overapproximation of someBinaryArithmeticFLOAToperation at line 80, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -1.4f && IN < 1.4f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -1.4f && IN < 1.4f) [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.2s, 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:48:24,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_3+newton_2_7.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 a7443921b0608d3c2ff1c61e12bf7cf129e5c1aecf22f0fb9785817b90c162e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:48:25,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:48:26,061 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:48:26,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:48:26,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:48:26,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:48:26,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:48:26,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:48:26,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:48:26,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:48:26,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:48:26,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:48:26,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:48:26,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:48:26,122 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:48:26,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:48:26,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:48:26,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:48:26,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:48:26,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:48:26,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:48:26,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:48:26,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:48:26,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:48:26,125 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:48:26,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:48:26,125 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 21:48:26,125 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 21:48:26,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:48:26,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:48:26,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:48:26,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:48:26,125 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 -> a7443921b0608d3c2ff1c61e12bf7cf129e5c1aecf22f0fb9785817b90c162e7 [2025-02-07 21:48:26,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:48:26,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:48:26,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:48:26,408 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:48:26,408 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:48:26,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_2_7.i [2025-02-07 21:48:27,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10910999c/a8316cf8d6b046f0825005072a13b64c/FLAG52613af9a [2025-02-07 21:48:27,804 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:48:27,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_2_7.i [2025-02-07 21:48:27,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10910999c/a8316cf8d6b046f0825005072a13b64c/FLAG52613af9a [2025-02-07 21:48:27,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10910999c/a8316cf8d6b046f0825005072a13b64c [2025-02-07 21:48:27,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:48:27,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:48:27,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:48:27,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:48:27,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:48:27,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:48:27" (1/1) ... [2025-02-07 21:48:27,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eff3353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:27, skipping insertion in model container [2025-02-07 21:48:27,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:48:27" (1/1) ... [2025-02-07 21:48:27,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:48:27,977 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_3+newton_2_7.i[1226,1239] [2025-02-07 21:48:28,003 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_3+newton_2_7.i[2841,2854] [2025-02-07 21:48:28,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:48:28,018 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:48:28,029 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_3+newton_2_7.i[1226,1239] [2025-02-07 21:48:28,045 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_3+newton_2_7.i[2841,2854] [2025-02-07 21:48:28,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:48:28,060 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:48:28,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28 WrapperNode [2025-02-07 21:48:28,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:48:28,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:48:28,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:48:28,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:48:28,067 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:48:28" (1/1) ... [2025-02-07 21:48:28,075 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:48:28" (1/1) ... [2025-02-07 21:48:28,090 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 78 [2025-02-07 21:48:28,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:48:28,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:48:28,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:48:28,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:48:28,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,112 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:48:28,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:48:28,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:48:28,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:48:28,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:48:28,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (1/1) ... [2025-02-07 21:48:28,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:48:28,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:48:28,167 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:48:28,169 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:48:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:48:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 21:48:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 21:48:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-02-07 21:48:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-02-07 21:48:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-07 21:48:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-07 21:48:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:48:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:48:28,242 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:48:28,244 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:48:36,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume false;assume false; [2025-02-07 21:48:36,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume !false; [2025-02-07 21:48:36,287 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:48:36,288 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:48:36,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:48:36,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: main1_#res#1 := 0bv32; [2025-02-07 21:48:36,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume 0bv32 == __VERIFIER_assert_~cond#1; [2025-02-07 21:48:36,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume !(0bv32 == __VERIFIER_assert_~cond#1); [2025-02-07 21:48:36,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume ~bvsgt~32(~sign_extend~32~8(main1_~x~0#1), 0bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~bvsge~32(~sign_extend~32~8(main1_~x~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:48:36,288 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: assume !~bvsgt~32(~sign_extend~32~8(main1_~x~0#1), 0bv32); [2025-02-07 21:48:36,288 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:48:36,289 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:48:36,289 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:48:40,383 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-07 21:48:40,383 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:48:40,389 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:48:40,389 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:48:40,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:48:40 BoogieIcfgContainer [2025-02-07 21:48:40,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:48:40,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:48:40,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:48:40,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:48:40,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:48:27" (1/3) ... [2025-02-07 21:48:40,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef0ea39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:48:40, skipping insertion in model container [2025-02-07 21:48:40,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:48:28" (2/3) ... [2025-02-07 21:48:40,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef0ea39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:48:40, skipping insertion in model container [2025-02-07 21:48:40,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:48:40" (3/3) ... [2025-02-07 21:48:40,396 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_7.i [2025-02-07 21:48:40,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:48:40,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_3+newton_2_7.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-07 21:48:40,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:48:40,449 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;@1a1118d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:48:40,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:48:40,453 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:48:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 21:48:40,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:48:40,458 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:48:40,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:48:40,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:48:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash -456046533, now seen corresponding path program 1 times [2025-02-07 21:48:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 21:48:40,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811007985] [2025-02-07 21:48:40,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:48:40,470 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:48:40,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 21:48:40,473 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:48:40,475 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:48:40,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 21:48:42,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 21:48:42,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:48:42,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:48:42,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 21:48:42,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:48:42,221 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:48:42,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:48:42,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 21:48:42,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811007985] [2025-02-07 21:48:42,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811007985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:48:42,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:48:42,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:48:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274001215] [2025-02-07 21:48:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:48:42,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:48:42,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 21:48:42,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:48:42,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:48:42,246 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:48:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:48:42,258 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-02-07 21:48:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:48:42,260 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:48:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:48:42,263 INFO L225 Difference]: With dead ends: 43 [2025-02-07 21:48:42,264 INFO L226 Difference]: Without dead ends: 19 [2025-02-07 21:48:42,266 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:48:42,269 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:48:42,270 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:48:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-07 21:48:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-07 21:48:42,289 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:48:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-07 21:48:42,294 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 24 [2025-02-07 21:48:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:48:42,294 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-07 21:48:42,294 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:48:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-02-07 21:48:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 21:48:42,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:48:42,297 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:48:42,341 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-07 21:48:42,501 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:48:42,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:48:42,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:48:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1800864474, now seen corresponding path program 1 times [2025-02-07 21:48:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 21:48:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955512232] [2025-02-07 21:48:42,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:48:42,516 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:48:42,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 21:48:42,518 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:48:42,519 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:48:42,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.