./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:56:55,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:56:55,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:56:55,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:56:55,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:56:55,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:56:55,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:56:55,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:56:55,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:56:55,639 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:56:55,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:56:55,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:56:55,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:56:55,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:56:55,640 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:56:55,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:56:55,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:56:55,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:56:55,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:56:55,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:56:55,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:56:55,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:56:55,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:56:55,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:56:55,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:56:55,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:56:55,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:56:55,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:56:55,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:56:55,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:56:55,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:56:55,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:56:55,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:56:55,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:56:55,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:56:55,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:56:55,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:56:55,644 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 [2025-01-09 00:56:55,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:56:55,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:56:55,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:56:55,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:56:55,861 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:56:55,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2025-01-09 00:56:57,002 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d65df6cfc/5b5d82d176754042b5fa142af46b760c/FLAG92783546e [2025-01-09 00:56:57,227 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:56:57,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2025-01-09 00:56:57,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d65df6cfc/5b5d82d176754042b5fa142af46b760c/FLAG92783546e [2025-01-09 00:56:57,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d65df6cfc/5b5d82d176754042b5fa142af46b760c [2025-01-09 00:56:57,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:56:57,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:56:57,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:56:57,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:56:57,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:56:57,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6369080d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57, skipping insertion in model container [2025-01-09 00:56:57,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:56:57,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2025-01-09 00:56:57,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:56:57,682 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:56:57,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2025-01-09 00:56:57,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:56:57,704 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:56:57,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57 WrapperNode [2025-01-09 00:56:57,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:56:57,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:56:57,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:56:57,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:56:57,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,730 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2025-01-09 00:56:57,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:56:57,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:56:57,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:56:57,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:56:57,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,742 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-01-09 00:56:57,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:56:57,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:56:57,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:56:57,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:56:57,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (1/1) ... [2025-01-09 00:56:57,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:56:57,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:56:57,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:56:57,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:56:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:56:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:56:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:56:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:56:57,825 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:56:57,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:56:57,894 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 00:56:57,894 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:56:57,899 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:56:57,899 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:56:57,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:56:57 BoogieIcfgContainer [2025-01-09 00:56:57,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:56:57,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:56:57,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:56:57,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:56:57,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:56:57" (1/3) ... [2025-01-09 00:56:57,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4cdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:56:57, skipping insertion in model container [2025-01-09 00:56:57,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:57" (2/3) ... [2025-01-09 00:56:57,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4cdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:56:57, skipping insertion in model container [2025-01-09 00:56:57,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:56:57" (3/3) ... [2025-01-09 00:56:57,906 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_pseudoconstant.c [2025-01-09 00:56:57,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:56:57,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_pseudoconstant.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 00:56:57,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:56:57,956 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;@45c5d232, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:56:57,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:56:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:56:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:56:57,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:56:57,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:56:57,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:56:57,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:56:57,974 INFO L85 PathProgramCache]: Analyzing trace with hash -588360081, now seen corresponding path program 1 times [2025-01-09 00:56:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:56:57,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155147288] [2025-01-09 00:56:57,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:56:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:56:58,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:56:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:56:58,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:56:58,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:56:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:56:58,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:56:58,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155147288] [2025-01-09 00:56:58,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155147288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:56:58,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:56:58,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:56:58,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043370402] [2025-01-09 00:56:58,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:56:58,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 00:56:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:56:58,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 00:56:58,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:56:58,104 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-01-09 00:56:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:56:58,111 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-01-09 00:56:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 00:56:58,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-01-09 00:56:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:56:58,116 INFO L225 Difference]: With dead ends: 30 [2025-01-09 00:56:58,116 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 00:56:58,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:56:58,119 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:56:58,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:56:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 00:56:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-09 00:56:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-01-09 00:56:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-01-09 00:56:58,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2025-01-09 00:56:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:56:58,141 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-09 00:56:58,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-01-09 00:56:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-01-09 00:56:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:56:58,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:56:58,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:56:58,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:56:58,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:56:58,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:56:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1397706707, now seen corresponding path program 1 times [2025-01-09 00:56:58,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:56:58,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576744042] [2025-01-09 00:56:58,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:56:58,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:56:58,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:56:58,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:56:58,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:56:58,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:56:58,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:56:58,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:56:58,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:56:58,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:56:58,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:56:58,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:56:58,197 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:56:58,198 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:56:58,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:56:58,203 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 00:56:58,217 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:56:58,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:56:58 BoogieIcfgContainer [2025-01-09 00:56:58,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:56:58,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:56:58,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:56:58,223 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:56:58,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:56:57" (3/4) ... [2025-01-09 00:56:58,225 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 00:56:58,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:56:58,226 INFO L158 Benchmark]: Toolchain (without parser) took 668.40ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 66.2MB in the end (delta: 46.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 00:56:58,226 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:56:58,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.40ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:56:58,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.98ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:56:58,227 INFO L158 Benchmark]: Boogie Preprocessor took 16.96ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:56:58,227 INFO L158 Benchmark]: RCFGBuilder took 151.58ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 87.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:56:58,227 INFO L158 Benchmark]: TraceAbstraction took 321.33ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 67.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:56:58,227 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 66.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:56:58,228 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.61ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 146.40ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.98ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.96ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 151.58ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 87.1MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 321.33ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 67.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 142.6MB. Free memory was 67.3MB in the beginning and 66.2MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: 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 44, overapproximation of someBinaryArithmeticDOUBLEoperation at line 30, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 28. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, dd, r; [L50] double epsilon = 1e-8; [L52] d = 1. VAL [_EPS=1/1000000] [L52] COND TRUE d <= 20. [L54] dd = __VERIFIER_nondet_double() [L55] CALL assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L18] COND FALSE !(!cond) VAL [_EPS=1/1000000] [L55] RET assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L57] CALL, EXPR SqrtR(dd) [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [_EPS=1/1000000] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [_EPS=1/1000000, xn=1] [L29] xnp1 = xn [L30] residu = 2.0*_EPS*(xn+xnp1) [L31] lsup = _EPS * (xn+xnp1) [L32] linf = -lsup [L33] cond = ((residu > lsup) || (residu < linf)) [L34] i = 0 VAL [_EPS=1/1000000, cond=0, i=0] [L35] COND FALSE !(\read(cond)) [L44] return 1.0 / xnp1; VAL [_EPS=1/1000000, i=0] [L57] RET, EXPR SqrtR(dd) [L57] r = SqrtR(dd) [L59] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L20] COND TRUE !(cond) VAL [_EPS=1/1000000] [L20] reach_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 18 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 00:56:58,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:57:00,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:57:00,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 00:57:00,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:57:00,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:57:00,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:57:00,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:57:00,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:57:00,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:57:00,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:57:00,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:57:00,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:57:00,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:57:00,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:57:00,276 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:57:00,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 00:57:00,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:57:00,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:57:00,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:57:00,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:57:00,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:57:00,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:57:00,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:57:00,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:57:00,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:57:00,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:57:00,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:57:00,279 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 [2025-01-09 00:57:00,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:57:00,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:57:00,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:57:00,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:57:00,528 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:57:00,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2025-01-09 00:57:01,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/451dd78d4/77094e971ca14ac1a9c0b077533aa2a7/FLAG4153a4e74 [2025-01-09 00:57:01,899 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:57:01,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2025-01-09 00:57:01,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/451dd78d4/77094e971ca14ac1a9c0b077533aa2a7/FLAG4153a4e74 [2025-01-09 00:57:02,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/451dd78d4/77094e971ca14ac1a9c0b077533aa2a7 [2025-01-09 00:57:02,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:57:02,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:57:02,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:57:02,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:57:02,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:57:02,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef9ff78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02, skipping insertion in model container [2025-01-09 00:57:02,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:57:02,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2025-01-09 00:57:02,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:57:02,412 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:57:02,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2025-01-09 00:57:02,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:57:02,435 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:57:02,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02 WrapperNode [2025-01-09 00:57:02,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:57:02,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:57:02,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:57:02,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:57:02,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,467 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 68 [2025-01-09 00:57:02,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:57:02,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:57:02,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:57:02,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:57:02,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,488 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-01-09 00:57:02,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:57:02,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:57:02,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:57:02,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:57:02,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (1/1) ... [2025-01-09 00:57:02,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:57:02,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:57:02,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:57:02,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:57:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:57:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 00:57:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:57:02,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:57:02,614 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:57:02,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:57:16,024 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 00:57:16,024 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:57:16,033 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:57:16,033 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:57:16,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:57:16 BoogieIcfgContainer [2025-01-09 00:57:16,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:57:16,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:57:16,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:57:16,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:57:16,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:57:02" (1/3) ... [2025-01-09 00:57:16,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b39bd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:57:16, skipping insertion in model container [2025-01-09 00:57:16,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:57:02" (2/3) ... [2025-01-09 00:57:16,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b39bd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:57:16, skipping insertion in model container [2025-01-09 00:57:16,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:57:16" (3/3) ... [2025-01-09 00:57:16,039 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_pseudoconstant.c [2025-01-09 00:57:16,048 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:57:16,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_pseudoconstant.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 00:57:16,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:57:16,085 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;@6b7c87d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:57:16,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:57:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:57:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:57:16,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:57:16,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:57:16,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:57:16,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:57:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -588360081, now seen corresponding path program 1 times [2025-01-09 00:57:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:57:16,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331525155] [2025-01-09 00:57:16,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:57:16,111 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-01-09 00:57:16,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:57:16,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 00:57:16,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 00:57:16,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:57:17,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:57:17,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:57:17,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:57:17,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 00:57:17,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:57:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:57:17,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:57:17,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:57:17,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331525155] [2025-01-09 00:57:17,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331525155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:57:17,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:57:17,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:57:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942999976] [2025-01-09 00:57:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:57:17,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 00:57:17,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:57:17,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 00:57:17,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:57:17,195 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-01-09 00:57:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:57:17,220 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-01-09 00:57:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 00:57:17,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-01-09 00:57:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:57:17,226 INFO L225 Difference]: With dead ends: 30 [2025-01-09 00:57:17,226 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 00:57:17,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:57:17,229 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:57:17,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:57:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 00:57:17,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-09 00:57:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-01-09 00:57:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-01-09 00:57:17,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2025-01-09 00:57:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:57:17,248 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-01-09 00:57:17,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-01-09 00:57:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-01-09 00:57:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:57:17,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:57:17,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:57:17,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 00:57:17,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:57:17,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:57:17,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:57:17,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1397706707, now seen corresponding path program 1 times [2025-01-09 00:57:17,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:57:17,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004514435] [2025-01-09 00:57:17,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:57:17,455 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-01-09 00:57:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:57:17,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 00:57:17,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 00:57:17,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:57:18,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:57:18,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:57:18,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:57:18,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 00:57:18,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:57:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:57:20,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:57:20,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:57:20,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004514435] [2025-01-09 00:57:20,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004514435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:57:20,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:57:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:57:20,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601544134] [2025-01-09 00:57:20,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:57:20,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:57:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:57:20,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:57:20,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:57:20,212 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-01-09 00:57:26,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:28,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:33,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:37,260 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-01-09 00:57:42,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.82s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:46,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:50,147 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-01-09 00:57:54,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:57:58,177 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-01-09 00:58:02,186 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-01-09 00:58:05,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:58:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:58:06,205 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-01-09 00:58:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:58:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-01-09 00:58:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:58:06,213 INFO L225 Difference]: With dead ends: 26 [2025-01-09 00:58:06,213 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 00:58:06,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:58:06,214 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:58:06,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 9 Unknown, 0 Unchecked, 45.6s Time] [2025-01-09 00:58:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 00:58:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 00:58:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-01-09 00:58:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-01-09 00:58:06,225 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2025-01-09 00:58:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:58:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-09 00:58:06,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-01-09 00:58:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-01-09 00:58:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 00:58:06,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:58:06,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:58:06,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 00:58:06,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:58:06,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:58:06,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:58:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1340448405, now seen corresponding path program 1 times [2025-01-09 00:58:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:58:06,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931208564] [2025-01-09 00:58:06,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:58:06,428 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-01-09 00:58:06,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:58:06,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 00:58:06,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 00:58:06,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 00:58:08,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 00:58:08,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:58:08,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:58:08,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 00:58:08,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:58:30,698 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 00:58:34,839 WARN L851 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2025-01-09 00:58:43,337 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)