./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:52:48,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:52:48,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:52:48,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:52:48,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:52:48,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:52:48,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:52:48,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:52:48,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:52:48,282 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:52:48,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:52:48,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:52:48,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:52:48,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:52:48,283 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:52:48,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:52:48,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:52:48,283 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:52:48,284 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:52:48,285 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:52:48,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:52:48,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:52:48,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:52:48,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:52:48,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:52:48,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:52:48,286 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:52:48,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:52:48,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:52:48,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:52:48,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:52:48,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:52:48,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:52:48,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:52:48,286 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 [2025-03-17 02:52:48,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:52:48,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:52:48,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:52:48,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:52:48,533 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:52:48,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-17 02:52:49,723 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0932fc01/ce91fc1096b54d8292a3b91683730fd0/FLAG391b6b2f1 [2025-03-17 02:52:49,966 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:52:49,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-17 02:52:49,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0932fc01/ce91fc1096b54d8292a3b91683730fd0/FLAG391b6b2f1 [2025-03-17 02:52:50,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0932fc01/ce91fc1096b54d8292a3b91683730fd0 [2025-03-17 02:52:50,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:52:50,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:52:50,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:52:50,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:52:50,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:52:50,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e36b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50, skipping insertion in model container [2025-03-17 02:52:50,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:52:50,189 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2025-03-17 02:52:50,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:52:50,245 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:52:50,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2025-03-17 02:52:50,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:52:50,287 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:52:50,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50 WrapperNode [2025-03-17 02:52:50,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:52:50,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:52:50,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:52:50,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:52:50,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,328 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2025-03-17 02:52:50,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:52:50,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:52:50,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:52:50,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:52:50,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,364 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:52:50,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:52:50,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:52:50,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:52:50,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:52:50,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (1/1) ... [2025-03-17 02:52:50,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:52:50,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:52:50,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:52:50,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:52:50,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:52:50,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:52:50,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:52:50,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:52:50,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:52:50,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:52:50,502 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:52:50,504 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:52:50,741 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:52:50,741 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:52:50,754 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:52:50,755 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:52:50,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:52:50 BoogieIcfgContainer [2025-03-17 02:52:50,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:52:50,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:52:50,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:52:50,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:52:50,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:52:50" (1/3) ... [2025-03-17 02:52:50,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1cdd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:52:50, skipping insertion in model container [2025-03-17 02:52:50,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:50" (2/3) ... [2025-03-17 02:52:50,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1cdd70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:52:50, skipping insertion in model container [2025-03-17 02:52:50,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:52:50" (3/3) ... [2025-03-17 02:52:50,763 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-17 02:52:50,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:52:50,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-25.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:52:50,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:52:50,828 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;@34ab796d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:52:50,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:52:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:52:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 02:52:50,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:52:50,843 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:52:50,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:52:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:52:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 152006526, now seen corresponding path program 1 times [2025-03-17 02:52:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:52:50,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177505086] [2025-03-17 02:52:50,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:52:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:52:50,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:52:50,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:52:50,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:52:50,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:52:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 02:52:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:52:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177505086] [2025-03-17 02:52:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177505086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:52:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492411191] [2025-03-17 02:52:51,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:52:51,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:52:51,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:52:51,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:52:51,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:52:51,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:52:51,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:52:51,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:52:51,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:52:51,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:52:51,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:52:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 02:52:51,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:52:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492411191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:52:51,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:52:51,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:52:51,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676251905] [2025-03-17 02:52:51,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:52:51,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:52:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:52:51,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:52:51,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:52:51,226 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:52:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:52:51,245 INFO L93 Difference]: Finished difference Result 101 states and 178 transitions. [2025-03-17 02:52:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:52:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2025-03-17 02:52:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:52:51,251 INFO L225 Difference]: With dead ends: 101 [2025-03-17 02:52:51,251 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 02:52:51,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:52:51,255 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-03-17 02:52:51,255 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-03-17 02:52:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 02:52:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 02:52:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:52:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2025-03-17 02:52:51,298 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 121 [2025-03-17 02:52:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:52:51,299 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2025-03-17 02:52:51,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:52:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2025-03-17 02:52:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 02:52:51,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:52:51,302 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:52:51,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:52:51,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:52:51,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:52:51,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:52:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1974649986, now seen corresponding path program 1 times [2025-03-17 02:52:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:52:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608922659] [2025-03-17 02:52:51,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:52:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:52:51,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:52:51,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:52:51,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:52:51,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:52:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 02:52:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:52:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608922659] [2025-03-17 02:52:52,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608922659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:52:52,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581272937] [2025-03-17 02:52:52,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:52:52,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:52:52,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:52:52,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:52:52,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:52:52,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:52:52,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:52:52,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:52:52,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:52:52,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 02:52:52,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:52:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 02:52:52,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:52:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 02:52:52,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581272937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:52:52,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:52:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-17 02:52:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202016648] [2025-03-17 02:52:52,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:52:52,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:52:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:52:52,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:52:52,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:52:52,706 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 02:52:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:52:53,177 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2025-03-17 02:52:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 02:52:53,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 121 [2025-03-17 02:52:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:52:53,180 INFO L225 Difference]: With dead ends: 151 [2025-03-17 02:52:53,180 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 02:52:53,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2025-03-17 02:52:53,181 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 216 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:52:53,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 129 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:52:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 02:52:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2025-03-17 02:52:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 54 states have internal predecessors, (65), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 02:52:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2025-03-17 02:52:53,223 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 121 [2025-03-17 02:52:53,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:52:53,224 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2025-03-17 02:52:53,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 02:52:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2025-03-17 02:52:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 02:52:53,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:52:53,225 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:52:53,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 02:52:53,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 02:52:53,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:52:53,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:52:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1606690727, now seen corresponding path program 1 times [2025-03-17 02:52:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:52:53,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315628192] [2025-03-17 02:52:53,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:52:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:52:53,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:52:53,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:52:53,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:52:53,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:52:53,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:52:53,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:52:53,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:52:53,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:52:53,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:52:53,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:52:53,642 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:52:53,643 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:52:53,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:52:53,650 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 02:52:53,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:52:53,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:52:53 BoogieIcfgContainer [2025-03-17 02:52:53,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:52:53,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:52:53,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:52:53,729 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:52:53,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:52:50" (3/4) ... [2025-03-17 02:52:53,732 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:52:53,733 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:52:53,734 INFO L158 Benchmark]: Toolchain (without parser) took 3690.42ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 71.1MB in the end (delta: 35.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2025-03-17 02:52:53,734 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:52:53,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.13ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:52:53,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.37ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:52:53,735 INFO L158 Benchmark]: Boogie Preprocessor took 52.83ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:52:53,736 INFO L158 Benchmark]: IcfgBuilder took 372.46ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 71.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:52:53,736 INFO L158 Benchmark]: TraceAbstraction took 2971.16ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 71.1MB in the end (delta: 764.4kB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2025-03-17 02:52:53,736 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 71.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:52:53,738 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.54ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.13ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.37ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.83ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 372.46ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 71.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2971.16ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 71.1MB in the end (delta: 764.4kB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 71.1MB 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 to_int at line 58, overapproximation of to_int at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 105. 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] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 63; [L31] signed long int var_1_10 = 4; [L32] signed long int var_1_11 = 25; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] 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=4, var_1_11=25, 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=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, 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=128, var_1_9=63] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, 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=128, var_1_9=63] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, 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=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, 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=128, var_1_9=63] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=25, 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=128, var_1_9=63] [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=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [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=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [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=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [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=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=10, var_1_8=128, var_1_9=63] [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=10, var_1_8=128, var_1_9=63] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=10, var_1_8=128, var_1_9=63] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=10, var_1_8=128, var_1_9=63] [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=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_8=128, var_1_9=63] [L87] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_8=128, var_1_9=63] [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=63] [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=63] [L89] var_1_9 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L90] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L91] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L91] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L92] var_1_10 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L93] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L94] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L94] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L95] var_1_13 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L96] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L97] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L97] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L98] var_1_14 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L99] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L100] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L100] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L113] RET updateVariables() [L114] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L48] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=4, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=4, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L49] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_0=4, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=4, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [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_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=1073741822, var_1_2=0, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [L56] unsigned long int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=1073741822, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=1073741822, var_1_2=0, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=128, var_1_9=-1] [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_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=1073741822, var_1_2=0, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_9=-1] [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=-1, var_1_11=-1, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=1073741822, var_1_2=0, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_9=-1] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] 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 == ((signed long int) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((signed long int) ((((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 == ((signed long int) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((signed long int) 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))) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=1073741822, var_1_2=0, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=1509114202, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=1073741822, var_1_2=0, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=-2147483655, var_1_7=-3221225473, var_1_8=1509114202, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 100 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 124 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 361 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 794 SizeOfPredicates, 1 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3753/3800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:52:53,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:52:55,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:52:55,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:52:55,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:52:55,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:52:55,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:52:55,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:52:55,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:52:55,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:52:55,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:52:55,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:52:55,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:52:55,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:52:55,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:52:55,873 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:52:55,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:52:55,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:52:55,875 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:52:55,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:52:55,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:52:55,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:52:55,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:52:55,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:52:55,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:52:55,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:52:55,877 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:52:55,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:52:55,877 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:52:55,877 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:52:55,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:52:55,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:52:55,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:52:55,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:52:55,877 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 [2025-03-17 02:52:56,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:52:56,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:52:56,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:52:56,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:52:56,146 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:52:56,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-17 02:52:57,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c5d7ba2/e9f1ffa9975f46ac8d081cf73da454d4/FLAG10002b376 [2025-03-17 02:52:57,553 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:52:57,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-17 02:52:57,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c5d7ba2/e9f1ffa9975f46ac8d081cf73da454d4/FLAG10002b376 [2025-03-17 02:52:57,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c5d7ba2/e9f1ffa9975f46ac8d081cf73da454d4 [2025-03-17 02:52:57,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:52:57,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:52:57,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:52:57,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:52:57,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:52:57,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e03d0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57, skipping insertion in model container [2025-03-17 02:52:57,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:52:57,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2025-03-17 02:52:57,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:52:57,788 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:52:57,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2025-03-17 02:52:57,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:52:57,837 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:52:57,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57 WrapperNode [2025-03-17 02:52:57,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:52:57,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:52:57,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:52:57,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:52:57,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,881 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-03-17 02:52:57,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:52:57,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:52:57,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:52:57,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:52:57,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,909 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:52:57,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:52:57,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:52:57,937 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:52:57,937 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:52:57,938 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (1/1) ... [2025-03-17 02:52:57,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:52:57,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:52:57,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:52:57,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:52:58,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:52:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:52:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:52:58,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:52:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:52:58,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:52:58,061 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:52:58,063 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:53:02,111 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:53:02,111 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:53:02,122 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:53:02,122 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:53:02,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:02 BoogieIcfgContainer [2025-03-17 02:53:02,122 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:53:02,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:53:02,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:53:02,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:53:02,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:52:57" (1/3) ... [2025-03-17 02:53:02,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3303db79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:53:02, skipping insertion in model container [2025-03-17 02:53:02,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:52:57" (2/3) ... [2025-03-17 02:53:02,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3303db79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:53:02, skipping insertion in model container [2025-03-17 02:53:02,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:02" (3/3) ... [2025-03-17 02:53:02,132 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2025-03-17 02:53:02,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:53:02,152 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-25.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:53:02,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:53:02,217 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;@471cea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:53:02,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:53:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:53:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 02:53:02,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:02,231 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:53:02,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:02,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash 152006526, now seen corresponding path program 1 times [2025-03-17 02:53:02,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:53:02,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340711761] [2025-03-17 02:53:02,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:02,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:53:02,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:53:02,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:53:02,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:53:02,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:53:02,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:53:02,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:02,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:02,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:53:02,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:53:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 02:53:02,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:53:02,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:53:02,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340711761] [2025-03-17 02:53:02,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340711761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:02,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:02,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:53:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583051310] [2025-03-17 02:53:02,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:02,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:53:02,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:53:02,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:53:02,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:53:02,507 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:02,528 INFO L93 Difference]: Finished difference Result 101 states and 178 transitions. [2025-03-17 02:53:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:53:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2025-03-17 02:53:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:02,534 INFO L225 Difference]: With dead ends: 101 [2025-03-17 02:53:02,534 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 02:53:02,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:53:02,540 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-03-17 02:53:02,541 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-03-17 02:53:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 02:53:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 02:53:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:53:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2025-03-17 02:53:02,566 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 121 [2025-03-17 02:53:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:02,567 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2025-03-17 02:53:02,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 02:53:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2025-03-17 02:53:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 02:53:02,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:02,570 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:53:02,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:53:02,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:53:02,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:02,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1974649986, now seen corresponding path program 1 times [2025-03-17 02:53:02,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:53:02,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137889588] [2025-03-17 02:53:02,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:02,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:53:02,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:53:02,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:53:02,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:53:02,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 02:53:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 02:53:02,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:02,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:02,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 02:53:02,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:53:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 02:53:03,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:53:03,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:53:03,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137889588] [2025-03-17 02:53:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137889588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:53:03,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521562587] [2025-03-17 02:53:03,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:03,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:53:03,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:53:03,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:53:03,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:53:03,126 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:53:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:04,504 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2025-03-17 02:53:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:53:04,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2025-03-17 02:53:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:04,526 INFO L225 Difference]: With dead ends: 109 [2025-03-17 02:53:04,526 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 02:53:04,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-03-17 02:53:04,527 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:04,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 135 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 02:53:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 02:53:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-17 02:53:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 02:53:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2025-03-17 02:53:04,540 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 121 [2025-03-17 02:53:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:04,541 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2025-03-17 02:53:04,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 02:53:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2025-03-17 02:53:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 02:53:04,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:04,544 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:53:04,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 02:53:04,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:53:04,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:04,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1606690727, now seen corresponding path program 1 times [2025-03-17 02:53:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:53:04,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373678980] [2025-03-17 02:53:04,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:04,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:53:04,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:53:04,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:53:04,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 02:53:04,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:53:04,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:53:04,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:04,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:53:04,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:53:04,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:53:04,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:53:04,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:04,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:53:04,952 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2025-03-17 02:53:04,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1838488523] [2025-03-17 02:53:04,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:04,953 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 02:53:04,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 02:53:04,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 02:53:04,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-17 02:53:05,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 02:53:05,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 02:53:05,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:05,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:05,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 02:53:05,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:54:09,079 WARN L286 SmtUtils]: Spent 11.51s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)