./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:49:40,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:49:40,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:49:40,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:49:40,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:49:40,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:49:40,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:49:40,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:49:40,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:49:40,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:49:40,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:49:40,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:49:40,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:49:40,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:49:40,995 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:49:40,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:49:40,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:49:40,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:49:40,997 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:49:40,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:49:40,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:49:40,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:49:40,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:49:40,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:49:40,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:49:40,997 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:49:40,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:49:40,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:49:40,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:49:40,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:49:40,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:49:40,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:49:40,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:49:40,998 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 [2025-03-08 02:49:41,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:49:41,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:49:41,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:49:41,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:49:41,244 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:49:41,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2025-03-08 02:49:42,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34a58107/cd23cf9362f94c6391ac190efa1e7fb4/FLAGfa0212440 [2025-03-08 02:49:42,574 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:49:42,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2025-03-08 02:49:42,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34a58107/cd23cf9362f94c6391ac190efa1e7fb4/FLAGfa0212440 [2025-03-08 02:49:42,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b34a58107/cd23cf9362f94c6391ac190efa1e7fb4 [2025-03-08 02:49:42,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:49:42,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:49:42,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:49:42,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:49:42,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:49:42,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:49:42" (1/1) ... [2025-03-08 02:49:42,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50dfa497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:42, skipping insertion in model container [2025-03-08 02:49:42,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:49:42" (1/1) ... [2025-03-08 02:49:42,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:49:43,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2025-03-08 02:49:43,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:49:43,080 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:49:43,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2025-03-08 02:49:43,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:49:43,110 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:49:43,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43 WrapperNode [2025-03-08 02:49:43,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:49:43,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:49:43,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:49:43,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:49:43,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,139 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2025-03-08 02:49:43,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:49:43,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:49:43,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:49:43,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:49:43,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,159 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:49:43,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:49:43,172 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:49:43,172 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:49:43,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:49:43,173 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (1/1) ... [2025-03-08 02:49:43,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:49:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:49:43,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:49:43,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:49:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:49:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:49:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:49:43,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:49:43,281 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:49:43,282 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:49:43,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: havoc main_~SqrtR____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~SqrtR__Input~0#1, main_~SqrtR__xn~0#1, main_~SqrtR__xnp1~0#1, main_~SqrtR__residu~0#1, main_~SqrtR__lsup~0#1, main_~SqrtR__linf~0#1, main_~SqrtR__i~0#1, main_~SqrtR__cond~0#1; [2025-03-08 02:49:43,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-08 02:49:43,382 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: havoc main_~SqrtR____CPAchecker_TMP_2~0#1;havoc main_~SqrtR____CPAchecker_TMP_1~0#1; [2025-03-08 02:49:43,388 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-08 02:49:43,388 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:49:43,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:49:43,397 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:49:43,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:49:43 BoogieIcfgContainer [2025-03-08 02:49:43,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:49:43,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:49:43,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:49:43,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:49:43,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:49:42" (1/3) ... [2025-03-08 02:49:43,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79127c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:49:43, skipping insertion in model container [2025-03-08 02:49:43,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:43" (2/3) ... [2025-03-08 02:49:43,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79127c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:49:43, skipping insertion in model container [2025-03-08 02:49:43,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:49:43" (3/3) ... [2025-03-08 02:49:43,404 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2025-03-08 02:49:43,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:49:43,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_constant.c.p+cfa-reducer.c that has 1 procedures, 24 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 02:49:43,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:49:43,456 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;@5673a1d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:49:43,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:49:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:49:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 02:49:43,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:49:43,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:49:43,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:49:43,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:49:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash 231116082, now seen corresponding path program 1 times [2025-03-08 02:49:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:49:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119847784] [2025-03-08 02:49:43,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:49:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:49:43,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 02:49:43,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:49:43,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:49:43,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:49:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:49:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:49:43,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119847784] [2025-03-08 02:49:43,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119847784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:49:43,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:49:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:49:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439885398] [2025-03-08 02:49:43,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:49:43,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:49:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:49:43,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:49:43,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:49:43,660 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:49:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:49:43,683 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2025-03-08 02:49:43,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:49:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 02:49:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:49:43,689 INFO L225 Difference]: With dead ends: 48 [2025-03-08 02:49:43,689 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 02:49:43,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:49:43,693 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:49:43,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:49:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 02:49:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 02:49:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:49:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-03-08 02:49:43,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2025-03-08 02:49:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:49:43,714 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-08 02:49:43,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:49:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-03-08 02:49:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 02:49:43,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:49:43,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:49:43,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:49:43,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:49:43,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:49:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash -642874672, now seen corresponding path program 1 times [2025-03-08 02:49:43,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:49:43,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534382847] [2025-03-08 02:49:43,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:49:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:49:43,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 02:49:43,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:49:43,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:49:43,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:49:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:49:43,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:49:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534382847] [2025-03-08 02:49:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534382847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:49:43,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:49:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:49:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750383160] [2025-03-08 02:49:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:49:43,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:49:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:49:43,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:49:43,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:49:43,789 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:49:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:49:43,804 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2025-03-08 02:49:43,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:49:43,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 02:49:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:49:43,805 INFO L225 Difference]: With dead ends: 27 [2025-03-08 02:49:43,805 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 02:49:43,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:49:43,806 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:49:43,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:49:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 02:49:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 02:49:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:49:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-08 02:49:43,810 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2025-03-08 02:49:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:49:43,811 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-08 02:49:43,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:49:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-03-08 02:49:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 02:49:43,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:49:43,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:49:43,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:49:43,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:49:43,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:49:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash -641891569, now seen corresponding path program 1 times [2025-03-08 02:49:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:49:43,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617424718] [2025-03-08 02:49:43,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:49:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:49:43,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 02:49:43,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:49:43,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:49:43,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 02:49:43,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 02:49:43,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 02:49:43,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:49:43,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:49:43,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 02:49:43,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 02:49:43,859 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 02:49:43,860 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:49:43,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:49:43,864 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 02:49:43,876 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:49:43,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:49:43 BoogieIcfgContainer [2025-03-08 02:49:43,879 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:49:43,879 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:49:43,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:49:43,880 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:49:43,880 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:49:43" (3/4) ... [2025-03-08 02:49:43,882 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 02:49:43,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:49:43,883 INFO L158 Benchmark]: Toolchain (without parser) took 960.95ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 68.6MB in the end (delta: 55.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 02:49:43,883 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:49:43,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.32ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 112.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:49:43,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.62ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.9MB in the end (delta: 992.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:49:43,884 INFO L158 Benchmark]: Boogie Preprocessor took 31.83ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:49:43,884 INFO L158 Benchmark]: IcfgBuilder took 224.79ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 98.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:49:43,884 INFO L158 Benchmark]: TraceAbstraction took 480.01ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 68.6MB in the end (delta: 29.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 02:49:43,885 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 167.8MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:49:43,885 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.32ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 112.9MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.62ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.9MB in the end (delta: 992.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.83ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 224.79ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 98.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 480.01ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 68.6MB in the end (delta: 29.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 167.8MB. Free memory is still 68.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: 101]: 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 someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 40, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 21. Possible FailurePath: [L1] int __return_main; [L11] double _EPS = 0.0000010; [L14] double __return_125; VAL [_EPS=1/1000000, __return_125=0, __return_main=0] [L17] double main__d; [L18] double main__r; [L19] main__d = 1.0 VAL [_EPS=1/1000000, __return_125=0, __return_main=0, main__d=1] [L21] COND TRUE main__d <= 20.0 [L24] double __tmp_1; [L25] __tmp_1 = main__d [L26] double SqrtR__Input; [L27] SqrtR__Input = __tmp_1 [L28] double SqrtR__xn; [L29] double SqrtR__xnp1; [L30] double SqrtR__residu; [L31] double SqrtR__lsup; [L32] double SqrtR__linf; [L33] int SqrtR__i; [L34] int SqrtR__cond; VAL [_EPS=1/1000000, __return_125=0, __return_main=0] [L35] COND TRUE SqrtR__Input <= 1.0 [L37] SqrtR__xn = 1.0 VAL [SqrtR__xn=1, _EPS=1/1000000, __return_125=0, __return_main=0] [L39] SqrtR__xnp1 = SqrtR__xn [L40] SqrtR__residu = (2.0 * _EPS) * (SqrtR__xn + SqrtR__xnp1) [L41] SqrtR__lsup = _EPS * (SqrtR__xn + SqrtR__xnp1) [L42] SqrtR__linf = -SqrtR__lsup [L43] int SqrtR____CPAchecker_TMP_0; VAL [_EPS=1/1000000, __return_125=0, __return_main=0] [L44] COND FALSE !(SqrtR__residu > SqrtR__lsup) VAL [_EPS=1/1000000, __return_125=0, __return_main=0] [L126] COND FALSE !(SqrtR__residu < SqrtR__linf) [L132] SqrtR____CPAchecker_TMP_0 = 0 VAL [SqrtR____CPAchecker_TMP_0=0, _EPS=1/1000000, __return_125=0, __return_main=0] [L49] SqrtR__cond = SqrtR____CPAchecker_TMP_0 [L50] SqrtR__i = 0 VAL [SqrtR__cond=0, SqrtR__i=0, _EPS=1/1000000, __return_125=0, __return_main=0] [L52] COND FALSE !(!(SqrtR__cond == 0)) [L85] __return_125 = 1.0 / SqrtR__xnp1 [L86] main__r = __return_125 [L87] int main____CPAchecker_TMP_0; VAL [SqrtR__i=0, _EPS=1/1000000, __return_125=53, __return_main=0] [L88] COND FALSE !(main__r >= 1.0) VAL [SqrtR__i=0, _EPS=1/1000000, __return_125=53, __return_main=0] [L114] main____CPAchecker_TMP_0 = 0 VAL [SqrtR__i=0, _EPS=1/1000000, __return_125=53, __return_main=0, main____CPAchecker_TMP_0=0] [L95] int __tmp_2; [L96] __tmp_2 = main____CPAchecker_TMP_0 [L97] int __VERIFIER_assert__cond; [L98] __VERIFIER_assert__cond = __tmp_2 VAL [SqrtR__i=0, _EPS=1/1000000, __VERIFIER_assert__cond=0, __return_125=53, __return_main=0] [L99] COND TRUE __VERIFIER_assert__cond == 0 VAL [SqrtR__i=0, _EPS=1/1000000, __return_125=53, __return_main=0] [L101] reach_error() VAL [SqrtR__i=0, _EPS=1/1000000, __return_125=53, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 33 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 57 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 02:49:43,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:49:45,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:49:45,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 02:49:45,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:49:45,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:49:45,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:49:45,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:49:45,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:49:45,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:49:45,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:49:45,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:49:45,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:49:45,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:49:45,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:49:45,836 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:49:45,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:49:45,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:49:45,836 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:49:45,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:49:45,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:49:45,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:49:45,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:49:45,837 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:49:45,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:49:45,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:49:45,838 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54d39a6a3598707eb000bd324eee861653a2a39c1655837786308f3da9918a18 [2025-03-08 02:49:46,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:49:46,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:49:46,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:49:46,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:49:46,096 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:49:46,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2025-03-08 02:49:47,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef14e6c5c/038cf33013454517bc891306712619ff/FLAG9a241b9ff [2025-03-08 02:49:47,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:49:47,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c [2025-03-08 02:49:47,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef14e6c5c/038cf33013454517bc891306712619ff/FLAG9a241b9ff [2025-03-08 02:49:47,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef14e6c5c/038cf33013454517bc891306712619ff [2025-03-08 02:49:47,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:49:47,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:49:47,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:49:47,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:49:47,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:49:47,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:47,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159569e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47, skipping insertion in model container [2025-03-08 02:49:47,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:47,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:49:47,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2025-03-08 02:49:47,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:49:47,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:49:47,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c.p+cfa-reducer.c[2369,2382] [2025-03-08 02:49:47,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:49:47,996 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:49:47,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47 WrapperNode [2025-03-08 02:49:47,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:49:47,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:49:47,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:49:47,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:49:48,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,020 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 98 [2025-03-08 02:49:48,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:49:48,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:49:48,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:49:48,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:49:48,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,036 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:49:48,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,040 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:49:48,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:49:48,048 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:49:48,048 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:49:48,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (1/1) ... [2025-03-08 02:49:48,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:49:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:49:48,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:49:48,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:49:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:49:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 02:49:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:49:48,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:49:48,161 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:49:48,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:49:58,870 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: havoc main_~SqrtR____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~SqrtR__Input~0#1, main_~SqrtR__xn~0#1, main_~SqrtR__xnp1~0#1, main_~SqrtR__residu~0#1, main_~SqrtR__lsup~0#1, main_~SqrtR__linf~0#1, main_~SqrtR__i~0#1, main_~SqrtR__cond~0#1; [2025-03-08 02:49:58,870 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-08 02:49:58,870 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: havoc main_~SqrtR____CPAchecker_TMP_2~0#1;havoc main_~SqrtR____CPAchecker_TMP_1~0#1; [2025-03-08 02:49:58,880 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 02:49:58,880 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:49:58,886 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:49:58,887 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:49:58,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:49:58 BoogieIcfgContainer [2025-03-08 02:49:58,887 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:49:58,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:49:58,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:49:58,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:49:58,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:49:47" (1/3) ... [2025-03-08 02:49:58,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0c4197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:49:58, skipping insertion in model container [2025-03-08 02:49:58,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:49:47" (2/3) ... [2025-03-08 02:49:58,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0c4197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:49:58, skipping insertion in model container [2025-03-08 02:49:58,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:49:58" (3/3) ... [2025-03-08 02:49:58,893 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c.p+cfa-reducer.c [2025-03-08 02:49:58,903 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:49:58,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_constant.c.p+cfa-reducer.c that has 1 procedures, 24 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 02:49:58,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:49:58,942 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;@14bc4bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:49:58,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:49:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:49:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 02:49:58,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:49:58,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:49:58,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:49:58,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:49:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash 231116082, now seen corresponding path program 1 times [2025-03-08 02:49:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:49:58,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42871840] [2025-03-08 02:49:58,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:49:58,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:49:58,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:49:58,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 02:49:58,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 02:49:59,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 02:50:00,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:50:00,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:50:00,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:50:00,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:50:00,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:50:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:50:00,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:50:00,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:50:00,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42871840] [2025-03-08 02:50:00,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42871840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:50:00,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:50:00,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:50:00,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292896199] [2025-03-08 02:50:00,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:50:00,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:50:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:50:00,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:50:00,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:50:00,605 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:50:04,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:10,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:14,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:18,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:20,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:25,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:50:25,459 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2025-03-08 02:50:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:50:25,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 02:50:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:50:25,465 INFO L225 Difference]: With dead ends: 48 [2025-03-08 02:50:25,465 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 02:50:25,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:50:25,468 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:50:25,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 24.8s Time] [2025-03-08 02:50:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 02:50:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 02:50:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:50:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-03-08 02:50:25,492 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2025-03-08 02:50:25,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:50:25,493 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-08 02:50:25,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:50:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-03-08 02:50:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 02:50:25,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:50:25,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:50:25,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 02:50:25,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:50:25,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:50:25,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:50:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash -642874672, now seen corresponding path program 1 times [2025-03-08 02:50:25,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:50:25,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400029791] [2025-03-08 02:50:25,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:50:25,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:50:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:50:25,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 02:50:25,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 02:50:25,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 02:50:26,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:50:26,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:50:26,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:50:26,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:50:26,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:50:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:50:28,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:50:28,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:50:28,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400029791] [2025-03-08 02:50:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400029791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:50:28,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:50:28,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:50:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743901456] [2025-03-08 02:50:28,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:50:28,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:50:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:50:28,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:50:28,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:50:28,541 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:50:33,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:35,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:39,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:44,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:48,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:52,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:50:57,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:51:01,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:51:05,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:51:09,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:51:13,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:51:17,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:51:20,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:51:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:51:21,619 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2025-03-08 02:51:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:51:21,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 02:51:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:51:21,628 INFO L225 Difference]: With dead ends: 49 [2025-03-08 02:51:21,628 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 02:51:21,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:51:21,629 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:51:21,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 11 Unknown, 0 Unchecked, 52.5s Time] [2025-03-08 02:51:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 02:51:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-08 02:51:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:51:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-08 02:51:21,631 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2025-03-08 02:51:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:51:21,631 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-08 02:51:21,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:51:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-03-08 02:51:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 02:51:21,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:51:21,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:51:21,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 02:51:21,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:51:21,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:51:21,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:51:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash 58189906, now seen corresponding path program 1 times [2025-03-08 02:51:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:51:21,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368452883] [2025-03-08 02:51:21,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:51:21,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 02:51:21,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:51:21,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 02:51:21,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 02:51:21,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 02:51:23,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:51:23,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:51:23,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:51:23,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:51:23,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:51:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:51:24,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:51:24,133 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:51:24,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368452883] [2025-03-08 02:51:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368452883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:51:24,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:51:24,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:51:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430506007] [2025-03-08 02:51:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:51:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:51:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:51:24,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:51:24,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:51:24,134 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:51:28,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []