./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.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-68.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 a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:46:47,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:46:47,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:46:47,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:46:47,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:46:47,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:46:47,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:46:47,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:46:47,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:46:47,395 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:46:47,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:46:47,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:46:47,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:46:47,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:46:47,396 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:46:47,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:46:47,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:46:47,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:46:47,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:46:47,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:46:47,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:46:47,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:46:47,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:46:47,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:46:47,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:46:47,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:46:47,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:46:47,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:46:47,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:46:47,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:47,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:46:47,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:46:47,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:46:47,400 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 -> a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 [2025-03-17 02:46:47,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:46:47,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:46:47,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:46:47,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:46:47,636 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:46:47,637 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-68.i [2025-03-17 02:46:48,834 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fed71eb/0b7eaa9c582b46baacc4d11b053e4ebf/FLAG643d13a30 [2025-03-17 02:46:49,108 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:46:49,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-17 02:46:49,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fed71eb/0b7eaa9c582b46baacc4d11b053e4ebf/FLAG643d13a30 [2025-03-17 02:46:49,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fed71eb/0b7eaa9c582b46baacc4d11b053e4ebf [2025-03-17 02:46:49,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:46:49,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:46:49,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:49,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:46:49,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:46:49,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466ba1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49, skipping insertion in model container [2025-03-17 02:46:49,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:46:49,260 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-68.i[917,930] [2025-03-17 02:46:49,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:49,303 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:46:49,312 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-68.i[917,930] [2025-03-17 02:46:49,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:49,345 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:46:49,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49 WrapperNode [2025-03-17 02:46:49,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:49,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:49,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:46:49,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:46:49,352 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:46:49" (1/1) ... [2025-03-17 02:46:49,363 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:46:49" (1/1) ... [2025-03-17 02:46:49,389 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-17 02:46:49,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:49,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:46:49,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:46:49,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:46:49,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,418 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:46:49,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:46:49,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:46:49,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:46:49,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:46:49,435 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (1/1) ... [2025-03-17 02:46:49,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:49,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:49,464 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:46:49,467 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:46:49,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:46:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:46:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:46:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:46:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:46:49,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:46:49,545 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:46:49,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:46:49,735 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:46:49,736 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:46:49,747 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:46:49,748 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:46:49,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:49 BoogieIcfgContainer [2025-03-17 02:46:49,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:46:49,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:46:49,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:46:49,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:46:49,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:46:49" (1/3) ... [2025-03-17 02:46:49,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6e24d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:49, skipping insertion in model container [2025-03-17 02:46:49,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:49" (2/3) ... [2025-03-17 02:46:49,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6e24d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:49, skipping insertion in model container [2025-03-17 02:46:49,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:49" (3/3) ... [2025-03-17 02:46:49,757 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-17 02:46:49,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:46:49,771 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-68.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:46:49,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:46:49,819 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;@f0d3008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:46:49,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:46:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:46:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 02:46:49,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:49,828 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1] [2025-03-17 02:46:49,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:49,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1151533509, now seen corresponding path program 1 times [2025-03-17 02:46:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:49,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938067761] [2025-03-17 02:46:49,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:49,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:49,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:46:49,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:46:49,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:49,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 02:46:50,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:50,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938067761] [2025-03-17 02:46:50,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938067761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:46:50,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374374562] [2025-03-17 02:46:50,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:50,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:46:50,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:50,084 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:46:50,086 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:46:50,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:46:50,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:46:50,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:50,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:50,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:46:50,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:46:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 02:46:50,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:46:50,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374374562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:50,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:46:50,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:46:50,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627027046] [2025-03-17 02:46:50,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:50,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:46:50,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:50,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:46:50,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:46:50,267 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:46:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:50,282 INFO L93 Difference]: Finished difference Result 93 states and 159 transitions. [2025-03-17 02:46:50,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:46:50,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2025-03-17 02:46:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:50,287 INFO L225 Difference]: With dead ends: 93 [2025-03-17 02:46:50,288 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 02:46:50,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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:46:50,293 INFO L435 NwaCegarLoop]: 68 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, 68 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:46:50,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:46:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 02:46:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 02:46:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:46:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2025-03-17 02:46:50,329 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 106 [2025-03-17 02:46:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:50,329 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2025-03-17 02:46:50,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:46:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2025-03-17 02:46:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 02:46:50,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:50,335 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1] [2025-03-17 02:46:50,343 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:46:50,536 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:46:50,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:50,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1939434148, now seen corresponding path program 1 times [2025-03-17 02:46:50,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:50,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777765745] [2025-03-17 02:46:50,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:50,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:46:50,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:46:50,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:50,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 02:46:50,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:46:50,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777765745] [2025-03-17 02:46:50,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777765745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:50,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:50,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:46:50,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169326104] [2025-03-17 02:46:50,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:50,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:46:50,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:46:50,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:46:50,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:46:50,793 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 02:46:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:50,823 INFO L93 Difference]: Finished difference Result 91 states and 135 transitions. [2025-03-17 02:46:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:46:50,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2025-03-17 02:46:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:50,825 INFO L225 Difference]: With dead ends: 91 [2025-03-17 02:46:50,825 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 02:46:50,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:50,827 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:46:50,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:46:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 02:46:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 02:46:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:46:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2025-03-17 02:46:50,835 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 106 [2025-03-17 02:46:50,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:50,838 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2025-03-17 02:46:50,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 02:46:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2025-03-17 02:46:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 02:46:50,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:50,839 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1] [2025-03-17 02:46:50,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:46:50,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:50,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1468029467, now seen corresponding path program 1 times [2025-03-17 02:46:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:46:50,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418263750] [2025-03-17 02:46:50,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:46:50,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:46:50,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:46:50,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:50,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:46:50,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569026547] [2025-03-17 02:46:50,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:50,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:46:50,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:50,988 INFO L229 MonitoredProcess]: Starting monitored process 3 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:46:50,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:46:51,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:46:51,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:46:51,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:51,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:46:51,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:46:51,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:46:51,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:46:51,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:51,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:46:51,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:46:51,181 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:46:51,181 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:46:51,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 02:46:51,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 02:46:51,386 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 02:46:51,444 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:46:51,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:46:51 BoogieIcfgContainer [2025-03-17 02:46:51,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:46:51,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:46:51,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:46:51,449 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:46:51,449 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:49" (3/4) ... [2025-03-17 02:46:51,451 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:46:51,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:46:51,452 INFO L158 Benchmark]: Toolchain (without parser) took 2312.08ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 71.2MB in the end (delta: 51.3MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2025-03-17 02:46:51,453 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:46:51,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.23ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 109.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:46:51,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.38ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 107.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:46:51,454 INFO L158 Benchmark]: Boogie Preprocessor took 37.51ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:46:51,454 INFO L158 Benchmark]: IcfgBuilder took 318.48ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:46:51,455 INFO L158 Benchmark]: TraceAbstraction took 1698.04ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 72.1MB in the end (delta: 16.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-17 02:46:51,455 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 167.8MB. Free memory was 71.2MB in the beginning and 71.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:46:51,456 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.79ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.23ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 109.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.38ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 107.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.51ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 318.48ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1698.04ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 72.1MB in the end (delta: 16.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 167.8MB. Free memory was 71.2MB in the beginning and 71.2MB in the end (delta: 50.8kB). 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 75, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] float var_1_2 = 64.5; [L24] float var_1_3 = 16.8; [L25] signed long int var_1_8 = 10; [L26] unsigned char var_1_9 = 0; [L27] double var_1_10 = 25.5; [L28] double var_1_11 = 999999999.729; [L29] double var_1_12 = 999.8; [L30] signed short int var_1_13 = -25; [L31] signed short int var_1_14 = -64; [L32] signed short int var_1_15 = 0; [L33] signed short int var_1_16 = -8; [L34] signed long int var_1_17 = 5; [L35] unsigned long int var_1_18 = 0; [L36] unsigned long int var_1_19 = 8; [L37] float var_1_20 = 32.375; [L38] signed long int var_1_21 = -10; [L39] signed short int last_1_var_1_13 = -25; [L40] signed long int last_1_var_1_17 = 5; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L103] last_1_var_1_13 = var_1_13 [L104] last_1_var_1_17 = var_1_17 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L74] var_1_2 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L75] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L76] var_1_3 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L77] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L78] var_1_8 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L82] var_1_9 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1] [L84] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L86] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L87] var_1_12 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_14 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= -8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 8192) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L92] var_1_15 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_15 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_15 >= -8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_15 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_15 <= 8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_16 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_16 >= -16383) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L98] var_1_19 = __VERIFIER_nondet_ulong() [L99] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L99] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L115] RET updateVariables() [L116] CALL step() [L44] signed long int stepLocal_2 = var_1_8 + last_1_var_1_17; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L45] COND FALSE !(\read(var_1_9)) [L52] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L54] var_1_17 = (var_1_13 + var_1_14) [L55] var_1_18 = var_1_19 [L56] var_1_20 = var_1_12 [L57] var_1_21 = var_1_17 [L58] signed long int stepLocal_1 = var_1_17; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_1=1, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L59] COND FALSE !(stepLocal_1 != var_1_21) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L62] unsigned long int stepLocal_0 = var_1_18 + var_1_21; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_0=1, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L63] COND TRUE (var_1_2 - var_1_3) >= var_1_10 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_0=1, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L64] COND TRUE stepLocal_0 >= (var_1_13 / var_1_8) [L65] var_1_1 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L116] RET step() [L117] CALL, EXPR property() [L107-L108] return ((((((((var_1_2 - var_1_3) >= var_1_10) ? (((var_1_18 + var_1_21) >= (var_1_13 / var_1_8)) ? (var_1_1 == ((signed long int) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : 1) : (var_1_9 ? (var_1_1 == ((signed long int) ((((var_1_21) > (var_1_18)) ? (var_1_21) : (var_1_18))))) : 1)) && ((var_1_17 != var_1_21) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1)) && (var_1_9 ? ((last_1_var_1_13 <= (var_1_8 + last_1_var_1_17)) ? (var_1_13 == ((signed short int) ((var_1_14 + var_1_15) + var_1_16))) : (var_1_13 == ((signed short int) var_1_15))) : (var_1_13 == ((signed short int) var_1_15)))) && (var_1_17 == ((signed long int) (var_1_13 + var_1_14)))) && (var_1_18 == ((unsigned long int) var_1_19))) && (var_1_20 == ((float) var_1_12))) && (var_1_21 == ((signed long int) var_1_17)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 89 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 134 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1600/1632 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:46:51,472 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-68.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 a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:46:53,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:46:53,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:46:53,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:46:53,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:46:53,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:46:53,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:46:53,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:46:53,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:46:53,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:46:53,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:46:53,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:46:53,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:46:53,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:46:53,459 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:46:53,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:46:53,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:46:53,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:46:53,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:46:53,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:46:53,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:46:53,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:46:53,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:46:53,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:46:53,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:46:53,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:53,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:46:53,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:46:53,462 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:46:53,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:46:53,462 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:46:53,462 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:46:53,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:46:53,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:46:53,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:46:53,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:46:53,463 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 -> a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 [2025-03-17 02:46:53,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:46:53,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:46:53,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:46:53,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:46:53,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:46:53,721 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-68.i [2025-03-17 02:46:54,869 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a30f4600/1113dc65b00343be8a101175991d3bdc/FLAG7a3841ce1 [2025-03-17 02:46:55,067 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:46:55,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-17 02:46:55,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a30f4600/1113dc65b00343be8a101175991d3bdc/FLAG7a3841ce1 [2025-03-17 02:46:55,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a30f4600/1113dc65b00343be8a101175991d3bdc [2025-03-17 02:46:55,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:46:55,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:46:55,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:55,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:46:55,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:46:55,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49aae29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55, skipping insertion in model container [2025-03-17 02:46:55,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:46:55,219 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-68.i[917,930] [2025-03-17 02:46:55,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:55,282 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:46:55,290 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-68.i[917,930] [2025-03-17 02:46:55,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:46:55,333 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:46:55,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55 WrapperNode [2025-03-17 02:46:55,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:46:55,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:55,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:46:55,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:46:55,342 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:46:55" (1/1) ... [2025-03-17 02:46:55,354 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:46:55" (1/1) ... [2025-03-17 02:46:55,378 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-17 02:46:55,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:46:55,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:46:55,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:46:55,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:46:55,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,403 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:46:55,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:46:55,424 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:46:55,424 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:46:55,428 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:46:55,429 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (1/1) ... [2025-03-17 02:46:55,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:46:55,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:46:55,453 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:46:55,455 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:46:55,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:46:55,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:46:55,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:46:55,474 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:46:55,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:46:55,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:46:55,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:46:55,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:46:58,412 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:46:58,412 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:46:58,421 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:46:58,423 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:46:58,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:58 BoogieIcfgContainer [2025-03-17 02:46:58,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:46:58,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:46:58,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:46:58,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:46:58,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:46:55" (1/3) ... [2025-03-17 02:46:58,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b68e979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:58, skipping insertion in model container [2025-03-17 02:46:58,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:46:55" (2/3) ... [2025-03-17 02:46:58,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b68e979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:46:58, skipping insertion in model container [2025-03-17 02:46:58,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:46:58" (3/3) ... [2025-03-17 02:46:58,431 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-17 02:46:58,441 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:46:58,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-68.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:46:58,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:46:58,487 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;@5ed633e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:46:58,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:46:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:46:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 02:46:58,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:58,500 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1] [2025-03-17 02:46:58,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:58,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1151533509, now seen corresponding path program 1 times [2025-03-17 02:46:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:46:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257666367] [2025-03-17 02:46:58,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:58,512 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:46:58,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:46:58,515 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:46:58,517 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:46:58,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:46:58,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:46:58,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:58,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:58,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:46:58,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:46:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 02:46:58,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:46:58,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:46:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257666367] [2025-03-17 02:46:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257666367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:58,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:58,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:46:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443812250] [2025-03-17 02:46:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:58,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:46:58,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:46:58,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:46:58,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:46:58,853 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:46:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:46:58,892 INFO L93 Difference]: Finished difference Result 93 states and 159 transitions. [2025-03-17 02:46:58,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:46:58,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2025-03-17 02:46:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:46:58,898 INFO L225 Difference]: With dead ends: 93 [2025-03-17 02:46:58,898 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 02:46:58,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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:46:58,901 INFO L435 NwaCegarLoop]: 68 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, 68 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:46:58,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:46:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 02:46:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 02:46:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:46:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2025-03-17 02:46:58,931 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 106 [2025-03-17 02:46:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:46:58,931 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2025-03-17 02:46:58,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 02:46:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2025-03-17 02:46:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 02:46:58,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:46:58,934 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1] [2025-03-17 02:46:58,946 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:46:59,135 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:46:59,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:46:59,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:46:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1939434148, now seen corresponding path program 1 times [2025-03-17 02:46:59,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:46:59,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203666444] [2025-03-17 02:46:59,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:46:59,137 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:46:59,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:46:59,139 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:46:59,139 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:46:59,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:46:59,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:46:59,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:46:59,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:46:59,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 02:46:59,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:46:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 02:46:59,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:46:59,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:46:59,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203666444] [2025-03-17 02:46:59,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203666444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:46:59,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:46:59,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:46:59,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664823799] [2025-03-17 02:46:59,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:46:59,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:46:59,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:46:59,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:46:59,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:46:59,444 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 02:47:01,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:47:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:47:01,018 INFO L93 Difference]: Finished difference Result 91 states and 135 transitions. [2025-03-17 02:47:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:47:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2025-03-17 02:47:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:47:01,044 INFO L225 Difference]: With dead ends: 91 [2025-03-17 02:47:01,044 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 02:47:01,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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:47:01,047 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:47:01,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 02:47:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 02:47:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 02:47:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 02:47:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2025-03-17 02:47:01,054 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 106 [2025-03-17 02:47:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:47:01,055 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2025-03-17 02:47:01,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 02:47:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2025-03-17 02:47:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 02:47:01,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:47:01,056 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1] [2025-03-17 02:47:01,070 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:47:01,256 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:47:01,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:47:01,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:47:01,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1468029467, now seen corresponding path program 1 times [2025-03-17 02:47:01,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:47:01,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160165999] [2025-03-17 02:47:01,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:47:01,258 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:47:01,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:47:01,261 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:47:01,263 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:47:01,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 02:47:01,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 02:47:01,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:47:01,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:47:01,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 02:47:01,521 INFO L279 TraceCheckSpWp]: Computing forward predicates...