./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:27:47,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:27:47,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:27:47,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:27:47,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:27:47,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:27:47,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:27:47,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:27:47,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:27:47,788 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:27:47,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:27:47,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:27:47,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:27:47,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:27:47,789 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:27:47,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:27:47,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:27:47,789 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:27:47,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:27:47,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:27:47,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:27:47,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:27:47,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:27:47,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:27:47,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:27:47,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:47,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:47,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:47,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:27:47,793 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c [2025-01-09 12:27:48,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:27:48,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:27:48,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:27:48,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:27:48,059 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:27:48,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2025-01-09 12:27:49,218 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aca8b3758/bcd9b39575bc4e39a97fd49b0a92ff74/FLAG8ea824a14 [2025-01-09 12:27:49,502 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:27:49,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2025-01-09 12:27:49,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aca8b3758/bcd9b39575bc4e39a97fd49b0a92ff74/FLAG8ea824a14 [2025-01-09 12:27:49,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aca8b3758/bcd9b39575bc4e39a97fd49b0a92ff74 [2025-01-09 12:27:49,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:27:49,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:27:49,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:49,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:27:49,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:27:49,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:49" (1/1) ... [2025-01-09 12:27:49,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f081c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:49, skipping insertion in model container [2025-01-09 12:27:49,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:49" (1/1) ... [2025-01-09 12:27:49,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:27:50,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i[917,930] [2025-01-09 12:27:50,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:50,144 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:27:50,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i[917,930] [2025-01-09 12:27:50,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:50,193 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:27:50,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50 WrapperNode [2025-01-09 12:27:50,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:50,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:50,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:27:50,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:27:50,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,233 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-01-09 12:27:50,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:50,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:27:50,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:27:50,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:27:50,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,255 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:27:50,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:27:50,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:27:50,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:27:50,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:27:50,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (1/1) ... [2025-01-09 12:27:50,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:50,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:50,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:27:50,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:27:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:27:50,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:27:50,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:27:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:27:50,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:27:50,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:27:50,372 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:27:50,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:27:50,544 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:27:50,545 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:27:50,554 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:27:50,555 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:27:50,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:50 BoogieIcfgContainer [2025-01-09 12:27:50,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:27:50,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:27:50,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:27:50,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:27:50,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:27:49" (1/3) ... [2025-01-09 12:27:50,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc8ebc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:50, skipping insertion in model container [2025-01-09 12:27:50,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:50" (2/3) ... [2025-01-09 12:27:50,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc8ebc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:50, skipping insertion in model container [2025-01-09 12:27:50,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:50" (3/3) ... [2025-01-09 12:27:50,569 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-25.i [2025-01-09 12:27:50,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:27:50,582 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-25.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:27:50,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:27:50,635 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;@35eddbff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:27:50,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:27:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:27:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 12:27:50,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:50,644 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:50,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:50,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 816379442, now seen corresponding path program 1 times [2025-01-09 12:27:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795148063] [2025-01-09 12:27:50,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:50,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:27:50,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:27:50,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:50,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 12:27:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:50,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795148063] [2025-01-09 12:27:50,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795148063] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:27:50,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136239207] [2025-01-09 12:27:50,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:50,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:27:50,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:50,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:27:50,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:27:50,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:27:50,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:27:50,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:50,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:50,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:27:50,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 12:27:50,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136239207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:50,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:27:50,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:27:50,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191546093] [2025-01-09 12:27:50,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:51,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:27:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:51,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:27:51,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:51,039 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:27:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:51,061 INFO L93 Difference]: Finished difference Result 104 states and 175 transitions. [2025-01-09 12:27:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:27:51,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-01-09 12:27:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:51,067 INFO L225 Difference]: With dead ends: 104 [2025-01-09 12:27:51,067 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 12:27:51,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:51,071 INFO L435 NwaCegarLoop]: 76 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, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:51,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:27:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 12:27:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 12:27:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:27:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2025-01-09 12:27:51,098 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 115 [2025-01-09 12:27:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:51,099 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2025-01-09 12:27:51,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:27:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2025-01-09 12:27:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 12:27:51,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:51,119 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:51,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:27:51,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:27:51,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:51,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash -785190610, now seen corresponding path program 1 times [2025-01-09 12:27:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:51,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337869221] [2025-01-09 12:27:51,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:51,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:51,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:27:51,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:27:51,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:51,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 12:27:52,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:27:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337869221] [2025-01-09 12:27:52,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337869221] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:27:52,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577926700] [2025-01-09 12:27:52,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:52,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:27:52,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:52,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:27:52,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:27:52,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:27:52,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:27:52,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:52,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:52,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 12:27:52,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 12:27:52,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:52,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577926700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:52,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:27:52,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2025-01-09 12:27:52,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124471937] [2025-01-09 12:27:52,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:52,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:27:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:27:52,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:27:52,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:27:52,370 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:27:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:52,650 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2025-01-09 12:27:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:27:52,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-01-09 12:27:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:52,652 INFO L225 Difference]: With dead ends: 111 [2025-01-09 12:27:52,652 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 12:27:52,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:27:52,653 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 112 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:52,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 177 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:27:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 12:27:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2025-01-09 12:27:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:27:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2025-01-09 12:27:52,663 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 115 [2025-01-09 12:27:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:52,663 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2025-01-09 12:27:52,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:27:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2025-01-09 12:27:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 12:27:52,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:52,664 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:52,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:27:52,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:27:52,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:52,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash 846198150, now seen corresponding path program 1 times [2025-01-09 12:27:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:27:52,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48063231] [2025-01-09 12:27:52,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:27:52,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 12:27:52,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 12:27:52,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:52,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:27:52,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:27:52,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 12:27:53,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 12:27:53,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:53,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:27:53,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:27:53,052 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:27:53,053 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:27:53,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:27:53,056 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 12:27:53,134 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:27:53,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:27:53 BoogieIcfgContainer [2025-01-09 12:27:53,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:27:53,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:27:53,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:27:53,141 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:27:53,142 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:50" (3/4) ... [2025-01-09 12:27:53,147 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:27:53,147 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:27:53,148 INFO L158 Benchmark]: Toolchain (without parser) took 3330.54ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 106.5MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2025-01-09 12:27:53,148 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:27:53,148 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.62ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:27:53,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.86ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:27:53,149 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:27:53,149 INFO L158 Benchmark]: RCFGBuilder took 279.40ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 77.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:27:53,149 INFO L158 Benchmark]: TraceAbstraction took 2580.41ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 106.5MB in the end (delta: -28.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2025-01-09 12:27:53,149 INFO L158 Benchmark]: Witness Printer took 6.45ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 106.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:27:53,150 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.44ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.62ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 98.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.86ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 96.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.48ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 279.40ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 77.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2580.41ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 106.5MB in the end (delta: -28.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 6.45ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 106.5MB in the end (delta: 41.6kB). 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 58, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 10; [L25] unsigned short int var_1_4 = 500; [L26] unsigned long int var_1_5 = 0; [L27] unsigned long int var_1_6 = 1509114200; [L28] unsigned long int var_1_7 = 10; [L29] float var_1_8 = 128.9; [L30] float var_1_9 = 63.363; [L31] float var_1_10 = 4.575; [L32] float var_1_11 = 25.5; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; VAL [isInitial=0, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L107] isInitial = 1 [L108] FCALL initially() [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L74] var_1_3 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L76] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L76] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L77] var_1_4 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L79] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L79] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L80] var_1_5 = __VERIFIER_nondet_ulong() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L83] var_1_6 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L86] var_1_7 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_8=1289/10, var_1_9=63363/1000] [L87] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_8=1289/10, var_1_9=63363/1000] [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10, var_1_9=63363/1000] [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10, var_1_9=63363/1000] [L89] var_1_9 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L90] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L91] var_1_10 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L92] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L93] var_1_13 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L94] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L95] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L95] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L96] var_1_14 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L97] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L98] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L98] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L111] RET updateVariables() [L112] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L48] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=8589934592, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=8589934592, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L49] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_0=8589934592, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=8589934592, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L50] COND TRUE stepLocal_0 <= var_1_4 [L51] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)) VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4831838207, var_1_2=1, var_1_3=8589934592, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L56] unsigned long int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=4831838207, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4831838207, var_1_2=1, var_1_3=8589934592, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1289/10] [L57] COND TRUE var_1_7 >= stepLocal_1 [L58] var_1_8 = ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))) VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4831838207, var_1_2=1, var_1_3=8589934592, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1/2, var_1_9=1/2] [L62] COND TRUE var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8))) [L63] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=8589934597, var_1_11=8589934597, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4831838207, var_1_2=1, var_1_3=8589934592, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1/2, var_1_9=1/2] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((var_1_12 ? ((var_1_3 <= var_1_4) ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)))) : 1) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_7 >= var_1_1) ? (var_1_8 == ((float) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))))) && ((var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8)))) ? (var_1_11 == ((float) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((float) var_1_9)) : 1))) && ((var_1_9 != var_1_10) ? ((var_1_2 || var_1_13) ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=8589934597, var_1_11=8589934597, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4831838207, var_1_2=1, var_1_3=8589934592, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1/2, var_1_9=1/2] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=8589934597, var_1_11=8589934597, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4831838207, var_1_2=1, var_1_3=8589934592, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1/2, var_1_9=1/2] [L19] reach_error() VAL [isInitial=1, var_1_10=8589934597, var_1_11=8589934597, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=4831838207, var_1_2=1, var_1_3=8589934592, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=-8053063680, var_1_8=1/2, var_1_9=1/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 126 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 616 SizeOfPredicates, 1 NumberOfNonLiveVariables, 516 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2411/2448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:27:53,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:27:55,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:27:55,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:27:55,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:27:55,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:27:55,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:27:55,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:27:55,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:27:55,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:27:55,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:27:55,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:27:55,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:27:55,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:27:55,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:27:55,378 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:27:55,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:27:55,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:27:55,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:27:55,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:27:55,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:27:55,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:27:55,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:27:55,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:27:55,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:55,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:55,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:55,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:27:55,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:27:55,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:27:55,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:27:55,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:27:55,381 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c [2025-01-09 12:27:55,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:27:55,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:27:55,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:27:55,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:27:55,650 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:27:55,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2025-01-09 12:27:56,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c23f39f0a/80d7c14688b14dc4b2279d6f4839680c/FLAG3645e37a9 [2025-01-09 12:27:57,088 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:27:57,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2025-01-09 12:27:57,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c23f39f0a/80d7c14688b14dc4b2279d6f4839680c/FLAG3645e37a9 [2025-01-09 12:27:57,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c23f39f0a/80d7c14688b14dc4b2279d6f4839680c [2025-01-09 12:27:57,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:27:57,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:27:57,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:57,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:27:57,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:27:57,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57, skipping insertion in model container [2025-01-09 12:27:57,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:27:57,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i[917,930] [2025-01-09 12:27:57,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:57,264 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:27:57,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i[917,930] [2025-01-09 12:27:57,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:27:57,295 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:27:57,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57 WrapperNode [2025-01-09 12:27:57,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:27:57,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:57,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:27:57,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:27:57,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,328 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-01-09 12:27:57,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:27:57,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:27:57,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:27:57,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:27:57,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,357 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:27:57,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:27:57,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:27:57,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:27:57,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:27:57,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (1/1) ... [2025-01-09 12:27:57,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:27:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:27:57,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:27:57,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:27:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:27:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:27:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:27:57,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:27:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:27:57,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:27:57,484 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:27:57,485 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:27:57,688 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:27:57,688 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:27:57,694 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:27:57,694 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:27:57,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:57 BoogieIcfgContainer [2025-01-09 12:27:57,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:27:57,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:27:57,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:27:57,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:27:57,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:27:57" (1/3) ... [2025-01-09 12:27:57,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bcf5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:57, skipping insertion in model container [2025-01-09 12:27:57,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:57" (2/3) ... [2025-01-09 12:27:57,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bcf5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:57, skipping insertion in model container [2025-01-09 12:27:57,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:57" (3/3) ... [2025-01-09 12:27:57,701 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-25.i [2025-01-09 12:27:57,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:27:57,711 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-25.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:27:57,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:27:57,770 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;@466e2d4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:27:57,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:27:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:27:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 12:27:57,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:57,783 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:57,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:57,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash 816379442, now seen corresponding path program 1 times [2025-01-09 12:27:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:27:57,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391735629] [2025-01-09 12:27:57,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:57,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:27:57,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:27:57,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:27:57,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 12:27:57,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:27:58,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:27:58,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:58,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:58,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:27:58,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 12:27:58,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:58,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:27:58,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391735629] [2025-01-09 12:27:58,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391735629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:58,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:58,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:27:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524128269] [2025-01-09 12:27:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:27:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:27:58,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:27:58,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:58,071 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:27:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:58,090 INFO L93 Difference]: Finished difference Result 104 states and 175 transitions. [2025-01-09 12:27:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:27:58,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-01-09 12:27:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:58,115 INFO L225 Difference]: With dead ends: 104 [2025-01-09 12:27:58,116 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 12:27:58,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:27:58,121 INFO L435 NwaCegarLoop]: 76 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, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:58,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:27:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 12:27:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 12:27:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:27:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2025-01-09 12:27:58,157 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 115 [2025-01-09 12:27:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:58,158 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2025-01-09 12:27:58,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:27:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2025-01-09 12:27:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 12:27:58,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:58,161 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:58,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 12:27:58,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:27:58,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:58,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash -785190610, now seen corresponding path program 1 times [2025-01-09 12:27:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:27:58,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147670391] [2025-01-09 12:27:58,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:58,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:27:58,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:27:58,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:27:58,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 12:27:58,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 12:27:58,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 12:27:58,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:58,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:58,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 12:27:58,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:27:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 12:27:58,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:27:58,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:27:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147670391] [2025-01-09 12:27:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147670391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:27:58,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:27:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:27:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829607941] [2025-01-09 12:27:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:27:58,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:27:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:27:58,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:27:58,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:27:58,706 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:27:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:27:59,003 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2025-01-09 12:27:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:27:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-01-09 12:27:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:27:59,005 INFO L225 Difference]: With dead ends: 111 [2025-01-09 12:27:59,005 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 12:27:59,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:27:59,006 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 113 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:27:59,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 117 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:27:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 12:27:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2025-01-09 12:27:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:27:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2025-01-09 12:27:59,024 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 115 [2025-01-09 12:27:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:27:59,024 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2025-01-09 12:27:59,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 12:27:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2025-01-09 12:27:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 12:27:59,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:27:59,025 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:27:59,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 12:27:59,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:27:59,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:27:59,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:27:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash 846198150, now seen corresponding path program 1 times [2025-01-09 12:27:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:27:59,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970534028] [2025-01-09 12:27:59,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:27:59,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:27:59,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:27:59,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:27:59,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 12:27:59,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 12:27:59,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 12:27:59,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:27:59,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:27:59,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 12:27:59,480 INFO L279 TraceCheckSpWp]: Computing forward predicates...