./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.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_loopvsstraightlinecode_25-1loop_file-73.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 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:31:52,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:31:52,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:31:52,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:31:52,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:31:52,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:31:52,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:31:52,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:31:52,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:31:52,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:31:52,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:31:52,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:31:52,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:31:52,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:31:52,862 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:31:52,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:31:52,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:31:52,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:31:52,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:31:52,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:31:52,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:31:52,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:31:52,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:31:52,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:31:52,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:31:52,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:31:52,865 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:31:52,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:31:52,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:31:52,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:31:52,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:31:52,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:31:52,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:31:52,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:31:52,865 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 -> 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 [2025-03-17 03:31:53,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:31:53,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:31:53,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:31:53,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:31:53,144 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:31:53,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2025-03-17 03:31:54,353 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7b408c4/50646fd0e3a5407e8d299915b6744847/FLAG90e29aca3 [2025-03-17 03:31:54,617 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:31:54,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2025-03-17 03:31:54,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7b408c4/50646fd0e3a5407e8d299915b6744847/FLAG90e29aca3 [2025-03-17 03:31:54,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7b408c4/50646fd0e3a5407e8d299915b6744847 [2025-03-17 03:31:54,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:31:54,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:31:54,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:31:54,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:31:54,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:31:54,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762996bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54, skipping insertion in model container [2025-03-17 03:31:54,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:31:54,811 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_loopvsstraightlinecode_25-1loop_file-73.i[915,928] [2025-03-17 03:31:54,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:31:54,861 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:31:54,871 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_loopvsstraightlinecode_25-1loop_file-73.i[915,928] [2025-03-17 03:31:54,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:31:54,902 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:31:54,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54 WrapperNode [2025-03-17 03:31:54,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:31:54,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:31:54,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:31:54,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:31:54,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,933 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-17 03:31:54,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:31:54,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:31:54,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:31:54,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:31:54,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,950 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 03:31:54,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:31:54,966 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:31:54,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:31:54,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:31:54,967 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (1/1) ... [2025-03-17 03:31:54,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:31:54,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:31:54,993 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 03:31:54,999 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 03:31:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:31:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:31:55,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:31:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:31:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:31:55,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:31:55,068 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:31:55,070 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:31:55,266 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:31:55,266 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:31:55,274 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:31:55,275 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:31:55,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:31:55 BoogieIcfgContainer [2025-03-17 03:31:55,275 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:31:55,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:31:55,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:31:55,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:31:55,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:31:54" (1/3) ... [2025-03-17 03:31:55,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec20bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:31:55, skipping insertion in model container [2025-03-17 03:31:55,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:54" (2/3) ... [2025-03-17 03:31:55,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec20bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:31:55, skipping insertion in model container [2025-03-17 03:31:55,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:31:55" (3/3) ... [2025-03-17 03:31:55,283 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-73.i [2025-03-17 03:31:55,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:31:55,296 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-73.i that has 2 procedures, 32 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:31:55,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:31:55,344 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;@5f765c0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:31:55,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:31:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 03:31:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 03:31:55,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:31:55,357 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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 03:31:55,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:31:55,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:31:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1993575827, now seen corresponding path program 1 times [2025-03-17 03:31:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:31:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833227704] [2025-03-17 03:31:55,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:55,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:31:55,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 03:31:55,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 03:31:55,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:55,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:31:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 03:31:55,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:31:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833227704] [2025-03-17 03:31:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833227704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:31:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882734523] [2025-03-17 03:31:55,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:55,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:31:55,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:31:55,560 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 03:31:55,568 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 03:31:55,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 03:31:55,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 03:31:55,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:55,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:31:55,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:31:55,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:31:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 03:31:55,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:31:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882734523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:31:55,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:31:55,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:31:55,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384380441] [2025-03-17 03:31:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:31:55,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:31:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:31:55,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:31:55,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:31:55,705 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 03:31:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:31:55,723 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2025-03-17 03:31:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:31:55,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-03-17 03:31:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:31:55,728 INFO L225 Difference]: With dead ends: 63 [2025-03-17 03:31:55,729 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 03:31:55,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 03:31:55,733 INFO L435 NwaCegarLoop]: 45 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, 45 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 03:31:55,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:31:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 03:31:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 03:31:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 03:31:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2025-03-17 03:31:55,761 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 58 [2025-03-17 03:31:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:31:55,761 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2025-03-17 03:31:55,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 03:31:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2025-03-17 03:31:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 03:31:55,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:31:55,763 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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 03:31:55,775 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 03:31:55,966 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 03:31:55,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:31:55,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:31:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1848200276, now seen corresponding path program 1 times [2025-03-17 03:31:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:31:55,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074465977] [2025-03-17 03:31:55,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:55,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:31:55,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 03:31:56,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 03:31:56,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:56,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:31:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 03:31:56,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:31:56,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074465977] [2025-03-17 03:31:56,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074465977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:31:56,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:31:56,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:31:56,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225049366] [2025-03-17 03:31:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:31:56,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:31:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:31:56,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:31:56,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:31:56,510 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 03:31:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:31:56,648 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2025-03-17 03:31:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:31:56,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2025-03-17 03:31:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:31:56,650 INFO L225 Difference]: With dead ends: 89 [2025-03-17 03:31:56,650 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 03:31:56,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:31:56,651 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:31:56,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 135 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:31:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 03:31:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2025-03-17 03:31:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 03:31:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-17 03:31:56,665 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 58 [2025-03-17 03:31:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:31:56,665 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-17 03:31:56,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 03:31:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-17 03:31:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 03:31:56,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:31:56,667 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:56,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:31:56,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:31:56,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:31:56,668 INFO L85 PathProgramCache]: Analyzing trace with hash 688525420, now seen corresponding path program 1 times [2025-03-17 03:31:56,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:31:56,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276541652] [2025-03-17 03:31:56,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:56,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:31:56,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 03:31:56,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 03:31:56,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:56,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:31:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 03:31:56,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:31:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276541652] [2025-03-17 03:31:56,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276541652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:31:56,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:31:56,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:31:56,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048761034] [2025-03-17 03:31:56,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:31:56,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:31:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:31:56,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:31:56,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:31:56,720 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 03:31:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:31:56,737 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2025-03-17 03:31:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:31:56,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2025-03-17 03:31:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:31:56,738 INFO L225 Difference]: With dead ends: 87 [2025-03-17 03:31:56,738 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 03:31:56,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:31:56,739 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:31:56,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:31:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 03:31:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-03-17 03:31:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 03:31:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2025-03-17 03:31:56,750 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 59 [2025-03-17 03:31:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:31:56,750 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2025-03-17 03:31:56,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 03:31:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2025-03-17 03:31:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 03:31:56,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:31:56,751 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:56,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:31:56,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:31:56,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:31:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 717154571, now seen corresponding path program 1 times [2025-03-17 03:31:56,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:31:56,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872514081] [2025-03-17 03:31:56,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:56,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:31:56,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 03:31:56,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 03:31:56,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:56,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:31:56,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:31:56,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 03:31:56,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 03:31:56,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:56,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:31:56,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:31:56,857 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:31:56,857 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:31:56,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:31:56,861 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 03:31:56,907 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:31:56,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:31:56 BoogieIcfgContainer [2025-03-17 03:31:56,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:31:56,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:31:56,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:31:56,914 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:31:56,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:31:55" (3/4) ... [2025-03-17 03:31:56,917 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:31:56,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:31:56,918 INFO L158 Benchmark]: Toolchain (without parser) took 2262.21ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 48.4MB in the end (delta: 75.0MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2025-03-17 03:31:56,918 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:31:56,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.52ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 110.5MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:31:56,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.25ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:31:56,919 INFO L158 Benchmark]: Boogie Preprocessor took 31.56ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 105.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:31:56,919 INFO L158 Benchmark]: IcfgBuilder took 308.95ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 89.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:31:56,920 INFO L158 Benchmark]: TraceAbstraction took 1636.03ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 48.4MB in the end (delta: 40.9MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-03-17 03:31:56,920 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 167.8MB. Free memory was 48.4MB in the beginning and 48.4MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:31:56,922 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.15ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.52ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 110.5MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.25ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.56ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 105.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 308.95ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 89.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1636.03ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 48.4MB in the end (delta: 40.9MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 167.8MB. Free memory was 48.4MB in the beginning and 48.4MB in the end (delta: 33.1kB). 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 someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_12 = 10; [L29] signed short int var_1_13 = -64; [L30] signed long int var_1_14 = 10; [L31] signed short int var_1_15 = -1; [L32] unsigned char last_1_var_1_8 = 25; [L33] signed long int last_1_var_1_14 = 10; [L85] isInitial = 1 [L86] FCALL initially() [L87] int k_loop; [L88] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L88] COND TRUE k_loop < 1 [L89] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_14 = var_1_14 [L89] RET updateLastVariables() [L90] CALL updateVariables() [L61] var_1_6 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L62] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L63] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L63] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L64] var_1_7 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L65] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L69] var_1_10 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L70] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L71] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L71] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L72] var_1_12 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L74] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=253, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=253, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L74] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=253, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L90] RET updateVariables() [L91] CALL step() [L37] signed long int stepLocal_0 = (((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))); VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, stepLocal_0=25, var_1_10=254, var_1_12=253, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L38] COND TRUE last_1_var_1_14 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=253, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=254] [L39] COND FALSE !(! var_1_6) [L42] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=253, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=25, var_1_9=254] [L45] COND TRUE \read(var_1_6) [L46] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=253, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] [L52] COND TRUE (9.99999999999995E13f + var_1_1) >= var_1_1 [L53] var_1_13 = (-4 + var_1_10) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=253, var_1_13=250, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] [L57] var_1_15 = var_1_12 [L58] var_1_14 = var_1_15 [L91] RET step() [L92] CALL, EXPR property() [L81-L82] return (((((last_1_var_1_14 <= ((((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((var_1_1 < (var_1_1 + var_1_7)) ? (var_1_8 == ((unsigned char) var_1_12)) : 1))) && (((9.99999999999995E13f + var_1_1) >= var_1_1) ? (var_1_13 == ((signed short int) (-4 + var_1_10))) : (var_1_13 == ((signed short int) (((((var_1_9) < (8)) ? (var_1_9) : (8))) - 32))))) && (var_1_14 == ((signed long int) var_1_15))) && (var_1_15 == ((signed short int) var_1_12)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=253, var_1_13=250, var_1_14=253, var_1_15=253, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=254, var_1_12=253, var_1_13=250, var_1_14=253, var_1_15=253, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=254, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 56 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 133 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 560/576 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 03:31:56,938 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_loopvsstraightlinecode_25-1loop_file-73.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 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:31:59,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:31:59,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:31:59,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:31:59,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:31:59,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:31:59,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:31:59,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:31:59,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:31:59,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:31:59,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:31:59,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:31:59,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:31:59,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:31:59,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:31:59,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:31:59,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:31:59,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:31:59,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:31:59,130 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 -> 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 [2025-03-17 03:31:59,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:31:59,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:31:59,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:31:59,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:31:59,415 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:31:59,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2025-03-17 03:32:00,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1efe9e967/3afdda9555c144c2b9316ade652f1ff9/FLAG59daf5202 [2025-03-17 03:32:00,886 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:32:00,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2025-03-17 03:32:00,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1efe9e967/3afdda9555c144c2b9316ade652f1ff9/FLAG59daf5202 [2025-03-17 03:32:01,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1efe9e967/3afdda9555c144c2b9316ade652f1ff9 [2025-03-17 03:32:01,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:32:01,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:32:01,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:01,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:32:01,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:32:01,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d22a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01, skipping insertion in model container [2025-03-17 03:32:01,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:32:01,393 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_loopvsstraightlinecode_25-1loop_file-73.i[915,928] [2025-03-17 03:32:01,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:01,431 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:32:01,438 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_loopvsstraightlinecode_25-1loop_file-73.i[915,928] [2025-03-17 03:32:01,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:01,471 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:32:01,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01 WrapperNode [2025-03-17 03:32:01,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:01,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:01,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:32:01,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:32:01,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,520 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-03-17 03:32:01,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:01,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:32:01,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:32:01,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:32:01,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,552 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 03:32:01,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:32:01,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:32:01,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:32:01,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:32:01,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (1/1) ... [2025-03-17 03:32:01,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:32:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:32:01,620 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 03:32:01,623 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 03:32:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:32:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:32:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:32:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:32:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:32:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:32:01,697 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:32:01,699 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:32:03,564 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:32:03,564 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:32:03,571 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:32:03,571 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:32:03,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:03 BoogieIcfgContainer [2025-03-17 03:32:03,572 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:32:03,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:32:03,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:32:03,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:32:03,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:32:01" (1/3) ... [2025-03-17 03:32:03,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d3e323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:03, skipping insertion in model container [2025-03-17 03:32:03,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:01" (2/3) ... [2025-03-17 03:32:03,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d3e323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:03, skipping insertion in model container [2025-03-17 03:32:03,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:03" (3/3) ... [2025-03-17 03:32:03,584 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-73.i [2025-03-17 03:32:03,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:32:03,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-73.i that has 2 procedures, 32 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:32:03,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:32:03,641 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;@3fe98256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:32:03,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:32:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 03:32:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 03:32:03,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:03,650 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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 03:32:03,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1993575827, now seen corresponding path program 1 times [2025-03-17 03:32:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:32:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659286468] [2025-03-17 03:32:03,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:03,662 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 03:32:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:32:03,666 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 03:32:03,667 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 03:32:03,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 03:32:03,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 03:32:03,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:03,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:03,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:32:03,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:32:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 03:32:03,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:32:03,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:32:03,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659286468] [2025-03-17 03:32:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659286468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:32:03,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:32:03,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:32:03,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153416872] [2025-03-17 03:32:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:32:03,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:32:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:32:03,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:32:03,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:32:03,947 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 03:32:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:32:03,972 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2025-03-17 03:32:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:32:03,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-03-17 03:32:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:32:03,983 INFO L225 Difference]: With dead ends: 63 [2025-03-17 03:32:03,983 INFO L226 Difference]: Without dead ends: 30 [2025-03-17 03:32:03,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 57 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 03:32:03,987 INFO L435 NwaCegarLoop]: 45 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, 45 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 03:32:03,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:32:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-17 03:32:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-17 03:32:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 03:32:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2025-03-17 03:32:04,019 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 58 [2025-03-17 03:32:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:32:04,020 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2025-03-17 03:32:04,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 03:32:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2025-03-17 03:32:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 03:32:04,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:04,022 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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 03:32:04,030 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 03:32:04,226 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 03:32:04,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1848200276, now seen corresponding path program 1 times [2025-03-17 03:32:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:32:04,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195984763] [2025-03-17 03:32:04,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:04,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:32:04,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:32:04,229 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 03:32:04,230 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 03:32:04,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 03:32:04,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 03:32:04,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:04,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:04,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:32:04,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:32:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 03:32:04,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:32:04,903 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:32:04,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195984763] [2025-03-17 03:32:04,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195984763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:32:04,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:32:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:32:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021333410] [2025-03-17 03:32:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:32:04,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:32:04,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:32:04,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:32:04,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:32:04,908 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 03:32:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:32:06,957 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2025-03-17 03:32:06,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:32:06,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2025-03-17 03:32:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:32:06,970 INFO L225 Difference]: With dead ends: 91 [2025-03-17 03:32:06,970 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 03:32:06,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:32:06,971 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:32:06,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 03:32:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 03:32:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2025-03-17 03:32:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 03:32:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-17 03:32:06,985 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 58 [2025-03-17 03:32:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:32:06,985 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-17 03:32:06,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 03:32:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-17 03:32:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 03:32:06,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:06,986 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:06,994 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-17 03:32:07,187 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 03:32:07,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:07,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:07,187 INFO L85 PathProgramCache]: Analyzing trace with hash 688525420, now seen corresponding path program 1 times [2025-03-17 03:32:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:32:07,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230922772] [2025-03-17 03:32:07,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:07,188 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 03:32:07,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:32:07,190 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 03:32:07,191 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 03:32:07,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 03:32:07,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 03:32:07,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:07,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:07,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 03:32:07,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:32:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 03:32:07,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:32:07,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:32:07,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230922772] [2025-03-17 03:32:07,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230922772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:32:07,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:32:07,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:32:07,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858355475] [2025-03-17 03:32:07,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:32:07,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:32:07,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:32:07,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:32:07,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:32:07,367 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 03:32:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:32:08,300 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2025-03-17 03:32:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:32:08,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2025-03-17 03:32:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:32:08,302 INFO L225 Difference]: With dead ends: 87 [2025-03-17 03:32:08,303 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 03:32:08,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:32:08,303 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:32:08,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:32:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 03:32:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-03-17 03:32:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 03:32:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2025-03-17 03:32:08,312 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 59 [2025-03-17 03:32:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:32:08,312 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2025-03-17 03:32:08,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 03:32:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2025-03-17 03:32:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 03:32:08,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:08,313 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:08,322 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-17 03:32:08,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:32:08,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:08,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash 717154571, now seen corresponding path program 1 times [2025-03-17 03:32:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:32:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063197409] [2025-03-17 03:32:08,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:08,515 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 03:32:08,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:32:08,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:32:08,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 03:32:08,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 03:32:08,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 03:32:08,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:08,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:08,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 03:32:08,708 INFO L279 TraceCheckSpWp]: Computing forward predicates...