./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i -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 5c3a6cfbeb64be96bf4eacae875b7628036a7e9302f517cb52ffb38da5c714c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:41:43,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:41:43,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:41:43,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:41:43,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:41:43,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:41:43,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:41:43,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:41:43,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:41:43,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:41:43,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:41:43,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:41:43,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:41:43,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:41:43,873 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:41:43,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:41:43,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:41:43,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:41:43,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:41:43,875 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:41:43,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:41:43,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:41:43,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:41:43,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:41:43,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:41:43,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:41:43,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:41:43,875 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 -> 5c3a6cfbeb64be96bf4eacae875b7628036a7e9302f517cb52ffb38da5c714c2 [2025-03-17 02:41:44,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:41:44,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:41:44,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:41:44,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:41:44,088 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:41:44,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i [2025-03-17 02:41:45,228 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72cce9f89/32356ce649d740e7b8dd5bde2324b86b/FLAG4662f11f0 [2025-03-17 02:41:45,445 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:41:45,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i [2025-03-17 02:41:45,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72cce9f89/32356ce649d740e7b8dd5bde2324b86b/FLAG4662f11f0 [2025-03-17 02:41:45,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72cce9f89/32356ce649d740e7b8dd5bde2324b86b [2025-03-17 02:41:45,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:41:45,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:41:45,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:41:45,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:41:45,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:41:45,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:45,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf32be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45, skipping insertion in model container [2025-03-17 02:41:45,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:45,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:41:45,910 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i[917,930] [2025-03-17 02:41:45,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:41:45,941 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:41:45,948 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i[917,930] [2025-03-17 02:41:45,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:41:45,971 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:41:45,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45 WrapperNode [2025-03-17 02:41:45,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:41:45,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:41:45,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:41:45,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:41:45,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:45,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,010 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2025-03-17 02:41:46,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:41:46,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:41:46,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:41:46,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:41:46,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,038 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-17 02:41:46,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:41:46,054 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:41:46,054 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:41:46,054 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:41:46,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 02:41:46,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:41:46,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:41:46,085 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-17 02:41:46,089 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-17 02:41:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:41:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:41:46,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:41:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:41:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:41:46,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:41:46,159 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:41:46,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:41:46,320 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 02:41:46,322 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:41:46,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:41:46,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:41:46,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:46 BoogieIcfgContainer [2025-03-17 02:41:46,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:41:46,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:41:46,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:41:46,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:41:46,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:45" (1/3) ... [2025-03-17 02:41:46,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b04d1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:46, skipping insertion in model container [2025-03-17 02:41:46,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (2/3) ... [2025-03-17 02:41:46,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b04d1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:46, skipping insertion in model container [2025-03-17 02:41:46,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:46" (3/3) ... [2025-03-17 02:41:46,337 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-29.i [2025-03-17 02:41:46,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:41:46,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-29.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:41:46,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:41:46,399 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;@52938e3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:41:46,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:41:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 02:41:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 02:41:46,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:46,407 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:41:46,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash -462395008, now seen corresponding path program 1 times [2025-03-17 02:41:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:41:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934181151] [2025-03-17 02:41:46,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:41:46,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:41:46,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:41:46,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:46,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 02:41:46,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:41:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934181151] [2025-03-17 02:41:46,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934181151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:41:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230984181] [2025-03-17 02:41:46,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:46,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:41:46,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:41:46,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:41:46,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:41:46,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:41:46,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:41:46,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:46,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:46,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:41:46,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:41:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 02:41:46,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:41:46,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230984181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:41:46,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:41:46,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:41:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834149619] [2025-03-17 02:41:46,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:41:46,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:41:46,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:41:46,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:41:46,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:41:46,683 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 02:41:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:41:46,699 INFO L93 Difference]: Finished difference Result 59 states and 94 transitions. [2025-03-17 02:41:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:41:46,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2025-03-17 02:41:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:41:46,705 INFO L225 Difference]: With dead ends: 59 [2025-03-17 02:41:46,705 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 02:41:46,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 45 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-03-17 02:41:46,709 INFO L435 NwaCegarLoop]: 41 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, 41 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-03-17 02:41:46,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:41:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 02:41:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-17 02:41:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 02:41:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2025-03-17 02:41:46,734 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 44 [2025-03-17 02:41:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:41:46,734 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2025-03-17 02:41:46,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 02:41:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2025-03-17 02:41:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 02:41:46,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:46,736 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:41:46,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 02:41:46,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:41:46,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:46,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash 202130046, now seen corresponding path program 1 times [2025-03-17 02:41:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:41:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87426483] [2025-03-17 02:41:46,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:41:46,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:41:47,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:41:47,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:47,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:41:47,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:41:47,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:41:47,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:41:47,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:47,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:41:47,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:41:47,104 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:41:47,105 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:41:47,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:41:47,108 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 02:41:47,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:41:47,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:41:47 BoogieIcfgContainer [2025-03-17 02:41:47,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:41:47,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:41:47,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:41:47,146 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:41:47,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:46" (3/4) ... [2025-03-17 02:41:47,149 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:41:47,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:41:47,150 INFO L158 Benchmark]: Toolchain (without parser) took 1355.58ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 59.7MB in the end (delta: 73.9MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-17 02:41:47,151 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:41:47,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.94ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 121.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:41:47,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 119.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:41:47,152 INFO L158 Benchmark]: Boogie Preprocessor took 42.32ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 116.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:41:47,153 INFO L158 Benchmark]: IcfgBuilder took 276.10ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 101.6MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:41:47,153 INFO L158 Benchmark]: TraceAbstraction took 813.52ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 59.7MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 02:41:47,154 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 167.8MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:41:47,155 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.43ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.94ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 121.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 119.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.32ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 116.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 276.10ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 101.6MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 813.52ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 59.7MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 167.8MB. Free memory is still 59.7MB. 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 2.5; [L23] float var_1_3 = 9.3; [L24] float var_1_4 = 3.4; [L25] unsigned short int var_1_5 = 32; [L26] unsigned short int var_1_9 = 1; [L27] unsigned char var_1_10 = 8; [L28] unsigned char var_1_11 = 5; [L29] unsigned char var_1_12 = 1; [L30] unsigned char var_1_13 = 1; [L31] unsigned char var_1_14 = 8; [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] FCALL updateLastVariables() [L84] CALL updateVariables() [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_4=17/5, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_4=17/5, var_1_5=32, var_1_9=1] [L63] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_4=17/5, var_1_5=32, var_1_9=1] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L65] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=5, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L66] var_1_11 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L67] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=8, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L68] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=8, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L69] var_1_13 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=4, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=4, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L70] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=4, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=4, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=4, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L71] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=4, var_1_12=1, var_1_13=-255, var_1_14=8, var_1_1=5/2, var_1_5=32, var_1_9=1] [L84] RET updateVariables() [L85] CALL step() [L35] var_1_12 = var_1_13 [L36] var_1_14 = var_1_11 VAL [isInitial=1, var_1_10=8, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=4, var_1_1=5/2, var_1_5=32, var_1_9=1] [L37] COND TRUE \read(var_1_12) [L38] var_1_1 = var_1_3 VAL [isInitial=1, var_1_10=8, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=4, var_1_1=53, var_1_3=53, var_1_5=32, var_1_9=1] [L44] COND TRUE (var_1_1 + 8.125) > (var_1_1 * var_1_3) [L45] var_1_5 = (((((var_1_14 + var_1_14)) > (var_1_14)) ? ((var_1_14 + var_1_14)) : (var_1_14))) VAL [isInitial=1, var_1_10=8, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=4, var_1_1=53, var_1_3=53, var_1_5=8, var_1_9=1] [L49] signed long int stepLocal_0 = 5 * var_1_14; VAL [isInitial=1, stepLocal_0=20, var_1_10=8, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=4, var_1_1=53, var_1_3=53, var_1_5=8, var_1_9=1] [L50] COND FALSE !(((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) VAL [isInitial=1, stepLocal_0=20, var_1_10=8, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=4, var_1_1=53, var_1_3=53, var_1_5=8, var_1_9=1] [L57] COND TRUE var_1_1 < var_1_3 [L58] var_1_10 = var_1_11 VAL [isInitial=1, stepLocal_0=20, var_1_10=4, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=4, var_1_1=53, var_1_3=53, var_1_5=8, var_1_9=1] [L85] RET step() [L86] CALL, EXPR property() [L76-L77] return (((((var_1_12 ? (var_1_1 == ((float) var_1_3)) : ((! (var_1_3 < var_1_4)) ? (var_1_1 == ((float) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1)) && (((var_1_1 + 8.125) > (var_1_1 * var_1_3)) ? (var_1_5 == ((unsigned short int) (((((var_1_14 + var_1_14)) > (var_1_14)) ? ((var_1_14 + var_1_14)) : (var_1_14))))) : (var_1_5 == ((unsigned short int) var_1_14)))) && ((((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) ? ((var_1_14 > (5 * var_1_14)) ? ((var_1_1 < (var_1_1 * 256.5f)) ? (var_1_9 == ((unsigned short int) var_1_14)) : 1) : 1) : 1)) && ((var_1_1 < var_1_3) ? (var_1_10 == ((unsigned char) var_1_11)) : 1)) && (var_1_12 == ((unsigned char) var_1_13))) && (var_1_14 == ((unsigned char) var_1_11)) ; [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=4, var_1_1=53, var_1_3=53, var_1_5=8, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=4, var_1_11=4, var_1_12=-255, var_1_13=-255, var_1_14=4, var_1_1=53, var_1_3=53, var_1_5=8, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 51 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 6, 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, 41 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, 41 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 86 SizeOfPredicates, 0 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 110/120 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-17 02:41:47,170 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i -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 5c3a6cfbeb64be96bf4eacae875b7628036a7e9302f517cb52ffb38da5c714c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:41:48,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:41:49,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:41:49,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:41:49,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:41:49,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:41:49,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:41:49,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:41:49,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:41:49,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:41:49,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:41:49,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:41:49,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:41:49,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:41:49,125 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:41:49,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:41:49,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:41:49,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:41:49,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:41:49,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:41:49,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:41:49,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:41:49,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:41:49,126 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:41:49,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:41:49,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:41:49,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:41:49,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:41:49,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:41:49,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:41:49,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:41:49,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:41:49,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:41:49,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:41:49,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:41:49,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:41:49,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:41:49,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:41:49,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:41:49,128 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:41:49,128 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:41:49,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:41:49,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:41:49,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:41:49,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:41:49,129 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 -> 5c3a6cfbeb64be96bf4eacae875b7628036a7e9302f517cb52ffb38da5c714c2 [2025-03-17 02:41:49,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:41:49,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:41:49,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:41:49,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:41:49,367 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:41:49,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i [2025-03-17 02:41:50,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc395fae6/f130a5bdff8849489ab231afb7579f60/FLAGd8f06cbe9 [2025-03-17 02:41:50,663 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:41:50,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i [2025-03-17 02:41:50,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc395fae6/f130a5bdff8849489ab231afb7579f60/FLAGd8f06cbe9 [2025-03-17 02:41:51,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc395fae6/f130a5bdff8849489ab231afb7579f60 [2025-03-17 02:41:51,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:41:51,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:41:51,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:41:51,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:41:51,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:41:51,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630620df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51, skipping insertion in model container [2025-03-17 02:41:51,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:41:51,154 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i[917,930] [2025-03-17 02:41:51,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:41:51,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:41:51,209 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-29.i[917,930] [2025-03-17 02:41:51,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:41:51,244 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:41:51,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51 WrapperNode [2025-03-17 02:41:51,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:41:51,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:41:51,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:41:51,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:41:51,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,280 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2025-03-17 02:41:51,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:41:51,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:41:51,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:41:51,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:41:51,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,297 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-17 02:41:51,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:41:51,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:41:51,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:41:51,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:41:51,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (1/1) ... [2025-03-17 02:41:51,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:41:51,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:41:51,340 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-17 02:41:51,345 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-17 02:41:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:41:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:41:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:41:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:41:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:41:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:41:51,422 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:41:51,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:41:58,280 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 02:41:58,280 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:41:58,289 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:41:58,291 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:41:58,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:58 BoogieIcfgContainer [2025-03-17 02:41:58,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:41:58,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:41:58,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:41:58,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:41:58,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:51" (1/3) ... [2025-03-17 02:41:58,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bafada0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:58, skipping insertion in model container [2025-03-17 02:41:58,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:51" (2/3) ... [2025-03-17 02:41:58,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bafada0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:58, skipping insertion in model container [2025-03-17 02:41:58,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:58" (3/3) ... [2025-03-17 02:41:58,299 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-29.i [2025-03-17 02:41:58,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:41:58,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-29.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:41:58,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:41:58,353 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;@2b45bffc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:41:58,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:41:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 02:41:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 02:41:58,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:58,363 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:41:58,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:58,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash -462395008, now seen corresponding path program 1 times [2025-03-17 02:41:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:41:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189582891] [2025-03-17 02:41:58,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:58,374 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-17 02:41:58,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:41:58,376 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-17 02:41:58,377 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-17 02:41:58,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:41:58,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:41:58,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:58,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:58,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:41:58,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:41:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 02:41:58,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:41:58,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:41:58,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189582891] [2025-03-17 02:41:58,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189582891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:41:58,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:41:58,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:41:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479141708] [2025-03-17 02:41:58,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:41:58,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:41:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:41:58,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:41:58,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:41:58,649 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 02:41:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:41:58,664 INFO L93 Difference]: Finished difference Result 59 states and 94 transitions. [2025-03-17 02:41:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:41:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2025-03-17 02:41:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:41:58,669 INFO L225 Difference]: With dead ends: 59 [2025-03-17 02:41:58,669 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 02:41:58,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 43 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-03-17 02:41:58,673 INFO L435 NwaCegarLoop]: 41 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, 41 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-03-17 02:41:58,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:41:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 02:41:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-17 02:41:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 02:41:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2025-03-17 02:41:58,696 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 44 [2025-03-17 02:41:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:41:58,696 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2025-03-17 02:41:58,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 02:41:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2025-03-17 02:41:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 02:41:58,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:41:58,698 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:41:58,706 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-17 02:41:58,898 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-17 02:41:58,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:41:58,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:41:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash 202130046, now seen corresponding path program 1 times [2025-03-17 02:41:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:41:58,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749191442] [2025-03-17 02:41:58,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:41:58,900 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-17 02:41:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:41:58,902 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-17 02:41:58,903 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-17 02:41:58,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:41:59,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:41:59,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:41:59,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:41:59,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 02:41:59,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:41:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 02:41:59,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:41:59,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:41:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749191442] [2025-03-17 02:41:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749191442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:41:59,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:41:59,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:41:59,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3311526] [2025-03-17 02:41:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:41:59,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:41:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:41:59,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:41:59,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:41:59,178 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 02:42:01,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:04,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:06,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:07,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:09,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:12,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:42:12,518 INFO L93 Difference]: Finished difference Result 69 states and 98 transitions. [2025-03-17 02:42:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:42:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2025-03-17 02:42:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:42:12,519 INFO L225 Difference]: With dead ends: 69 [2025-03-17 02:42:12,519 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 02:42:12,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:42:12,520 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:42:12,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 60 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2025-03-17 02:42:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 02:42:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-03-17 02:42:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 02:42:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2025-03-17 02:42:12,530 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 44 [2025-03-17 02:42:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:42:12,531 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2025-03-17 02:42:12,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 02:42:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2025-03-17 02:42:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 02:42:12,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:42:12,532 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:42:12,541 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-17 02:42:12,732 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-17 02:42:12,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:42:12,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:42:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 202159837, now seen corresponding path program 1 times [2025-03-17 02:42:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:42:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811976789] [2025-03-17 02:42:12,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:42:12,733 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-17 02:42:12,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:42:12,736 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-17 02:42:12,737 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-17 02:42:12,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 02:42:12,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 02:42:12,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:42:12,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:42:12,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 02:42:12,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:42:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 02:42:14,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:42:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 02:42:14,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:42:14,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811976789] [2025-03-17 02:42:14,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811976789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:42:14,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 02:42:14,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-17 02:42:14,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060873732] [2025-03-17 02:42:14,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 02:42:14,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:42:14,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:42:14,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:42:14,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:42:14,517 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 02:42:16,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:18,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:20,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:23,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:26,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:28,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:42:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:42:29,325 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2025-03-17 02:42:29,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:42:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 44 [2025-03-17 02:42:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:42:29,326 INFO L225 Difference]: With dead ends: 88 [2025-03-17 02:42:29,326 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 02:42:29,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2025-03-17 02:42:29,327 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 114 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:42:29,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 74 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2025-03-17 02:42:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 02:42:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2025-03-17 02:42:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 02:42:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2025-03-17 02:42:29,332 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 44 [2025-03-17 02:42:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:42:29,333 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-03-17 02:42:29,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 02:42:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2025-03-17 02:42:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 02:42:29,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:42:29,334 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:42:29,343 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 (4)] Ended with exit code 0 [2025-03-17 02:42:29,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-17 02:42:29,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:42:29,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:42:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1947114122, now seen corresponding path program 1 times [2025-03-17 02:42:29,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:42:29,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442422938] [2025-03-17 02:42:29,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:42:29,535 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-17 02:42:29,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:42:29,537 INFO L229 MonitoredProcess]: Starting monitored process 5 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-17 02:42:29,538 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 (5)] Waiting until timeout for monitored process [2025-03-17 02:42:29,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 02:42:29,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 02:42:29,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:42:29,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:42:29,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 02:42:29,732 INFO L279 TraceCheckSpWp]: Computing forward predicates...