./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9427caecab7d47f6d79e965c4c7e61e381997b7011e11cf9c6567c6c8d4e38d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:10:48,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:10:48,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:10:48,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:10:48,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:10:48,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:10:48,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:10:48,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:10:48,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:10:48,841 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:10:48,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:10:48,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:10:48,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:10:48,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:10:48,841 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:10:48,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:10:48,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:10:48,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:10:48,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:10:48,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:10:48,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:10:48,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:10:48,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:10:48,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:10:48,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:10:48,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:10:48,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:10:48,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:10:48,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:10:48,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:10:48,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:10:48,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:10:48,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:10:48,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:10:48,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:10:48,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:10:48,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:10:48,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:10:48,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:10:48,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:10:48,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:10:48,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:10:48,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:10:48,844 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9427caecab7d47f6d79e965c4c7e61e381997b7011e11cf9c6567c6c8d4e38d [2025-02-06 01:10:49,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:10:49,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:10:49,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:10:49,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:10:49,048 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:10:49,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i [2025-02-06 01:10:50,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34f9d4b3b/b48cf842b7ef42959cf113edf16d603a/FLAG8e404690a [2025-02-06 01:10:50,498 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:10:50,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i [2025-02-06 01:10:50,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34f9d4b3b/b48cf842b7ef42959cf113edf16d603a/FLAG8e404690a [2025-02-06 01:10:50,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34f9d4b3b/b48cf842b7ef42959cf113edf16d603a [2025-02-06 01:10:50,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:10:50,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:10:50,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:10:50,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:10:50,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:10:50,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:10:50" (1/1) ... [2025-02-06 01:10:50,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124ff43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:50, skipping insertion in model container [2025-02-06 01:10:50,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:10:50" (1/1) ... [2025-02-06 01:10:50,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:10:50,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i[915,928] [2025-02-06 01:10:50,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:10:50,984 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:10:50,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i[915,928] [2025-02-06 01:10:51,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:10:51,030 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:10:51,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51 WrapperNode [2025-02-06 01:10:51,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:10:51,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:10:51,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:10:51,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:10:51,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,074 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-02-06 01:10:51,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:10:51,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:10:51,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:10:51,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:10:51,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,100 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-02-06 01:10:51,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:10:51,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:10:51,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:10:51,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:10:51,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (1/1) ... [2025-02-06 01:10:51,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:10:51,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:51,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:10:51,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:10:51,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:10:51,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:10:51,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:10:51,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:10:51,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:10:51,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:10:51,205 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:10:51,206 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:10:51,393 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 01:10:51,394 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:10:51,406 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:10:51,406 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:10:51,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:10:51 BoogieIcfgContainer [2025-02-06 01:10:51,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:10:51,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:10:51,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:10:51,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:10:51,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:10:50" (1/3) ... [2025-02-06 01:10:51,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3fca2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:10:51, skipping insertion in model container [2025-02-06 01:10:51,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:51" (2/3) ... [2025-02-06 01:10:51,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3fca2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:10:51, skipping insertion in model container [2025-02-06 01:10:51,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:10:51" (3/3) ... [2025-02-06 01:10:51,419 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-38.i [2025-02-06 01:10:51,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:10:51,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-38.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:10:51,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:10:51,498 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;@725283c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:10:51,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:10:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:10:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 01:10:51,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:51,511 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:10:51,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:51,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1953460282, now seen corresponding path program 1 times [2025-02-06 01:10:51,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:51,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497296770] [2025-02-06 01:10:51,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:51,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:10:51,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:10:51,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:51,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 01:10:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:51,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497296770] [2025-02-06 01:10:51,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497296770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:10:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355818007] [2025-02-06 01:10:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:51,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:51,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:51,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:10:51,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:10:51,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:10:51,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:10:51,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:51,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:51,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:10:51,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:10:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-02-06 01:10:51,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:10:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355818007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:10:51,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:10:51,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:10:51,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520418264] [2025-02-06 01:10:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:10:51,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:10:51,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:51,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:10:51,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:10:51,933 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 01:10:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:51,948 INFO L93 Difference]: Finished difference Result 105 states and 173 transitions. [2025-02-06 01:10:51,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:10:51,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2025-02-06 01:10:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:51,955 INFO L225 Difference]: With dead ends: 105 [2025-02-06 01:10:51,955 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 01:10:51,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-02-06 01:10:51,960 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:51,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:10:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 01:10:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 01:10:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:10:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2025-02-06 01:10:51,992 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 124 [2025-02-06 01:10:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:51,993 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2025-02-06 01:10:51,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 01:10:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2025-02-06 01:10:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 01:10:51,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:51,996 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:10:52,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:10:52,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:10:52,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:52,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1163438006, now seen corresponding path program 1 times [2025-02-06 01:10:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:52,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880497629] [2025-02-06 01:10:52,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:52,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:10:52,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:10:52,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:52,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-02-06 01:10:52,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:10:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880497629] [2025-02-06 01:10:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880497629] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:10:52,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587283852] [2025-02-06 01:10:52,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:52,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:52,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:52,926 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:10:52,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:10:52,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:10:53,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:10:53,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:53,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:10:53,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 01:10:53,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:10:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 272 proven. 96 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 01:10:53,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:10:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 99 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-02-06 01:10:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587283852] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:10:53,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:10:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2025-02-06 01:10:53,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343026952] [2025-02-06 01:10:53,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:10:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 01:10:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:10:53,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 01:10:53,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-06 01:10:53,892 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 5 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (55), 4 states have call predecessors, (55), 5 states have call successors, (55) [2025-02-06 01:10:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:10:54,231 INFO L93 Difference]: Finished difference Result 113 states and 155 transitions. [2025-02-06 01:10:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 01:10:54,232 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 5 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (55), 4 states have call predecessors, (55), 5 states have call successors, (55) Word has length 124 [2025-02-06 01:10:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:10:54,233 INFO L225 Difference]: With dead ends: 113 [2025-02-06 01:10:54,234 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 01:10:54,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2025-02-06 01:10:54,235 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:10:54,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 193 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:10:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 01:10:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-02-06 01:10:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:10:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2025-02-06 01:10:54,245 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 124 [2025-02-06 01:10:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:10:54,246 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2025-02-06 01:10:54,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 5 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (55), 4 states have call predecessors, (55), 5 states have call successors, (55) [2025-02-06 01:10:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2025-02-06 01:10:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 01:10:54,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:10:54,247 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:10:54,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:10:54,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:10:54,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:10:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:10:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash -275934325, now seen corresponding path program 1 times [2025-02-06 01:10:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:10:54,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543274683] [2025-02-06 01:10:54,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:10:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:10:54,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:10:54,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:10:54,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:54,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:10:54,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:10:54,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:10:54,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:10:54,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:10:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:10:54,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:10:54,613 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:10:54,613 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:10:54,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:10:54,617 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 01:10:54,697 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:10:54,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:10:54 BoogieIcfgContainer [2025-02-06 01:10:54,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:10:54,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:10:54,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:10:54,701 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:10:54,701 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:10:51" (3/4) ... [2025-02-06 01:10:54,705 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:10:54,706 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:10:54,707 INFO L158 Benchmark]: Toolchain (without parser) took 3903.41ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 114.3MB in the beginning and 177.7MB in the end (delta: -63.5MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2025-02-06 01:10:54,707 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:10:54,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.70ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 101.6MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:10:54,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.79ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:10:54,708 INFO L158 Benchmark]: Boogie Preprocessor took 33.44ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:10:54,708 INFO L158 Benchmark]: IcfgBuilder took 298.72ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 77.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:10:54,708 INFO L158 Benchmark]: TraceAbstraction took 3288.20ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 76.4MB in the beginning and 177.8MB in the end (delta: -101.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2025-02-06 01:10:54,708 INFO L158 Benchmark]: Witness Printer took 5.35ms. Allocated memory is still 285.2MB. Free memory was 177.8MB in the beginning and 177.7MB in the end (delta: 63.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:10:54,711 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.17ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.70ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 101.6MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.79ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 98.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.44ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 94.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 298.72ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 77.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3288.20ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 76.4MB in the beginning and 177.8MB in the end (delta: -101.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 5.35ms. Allocated memory is still 285.2MB. Free memory was 177.8MB in the beginning and 177.7MB in the end (delta: 63.9kB). 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 someBinaryArithmeticDOUBLEoperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_3 = 52902; [L25] unsigned short int var_1_4 = 8; [L26] unsigned long int var_1_5 = 16; [L27] unsigned long int var_1_6 = 1771558822; [L28] double var_1_7 = 7.25; [L29] double var_1_8 = 31.2; [L30] double var_1_9 = 32.71; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 7.75; [L33] unsigned short int var_1_12 = 32; [L34] unsigned char var_1_13 = 0; [L35] unsigned short int var_1_14 = 20114; [L36] unsigned short int var_1_15 = 32; [L37] unsigned short int var_1_16 = 16773; VAL [isInitial=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L98] isInitial = 1 [L99] FCALL initially() [L100] int k_loop; [L101] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L101] COND TRUE k_loop < 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L58] var_1_2 = __VERIFIER_nondet_ushort() [L59] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L59] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L60] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L60] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L61] var_1_3 = __VERIFIER_nondet_ushort() [L62] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L62] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L63] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L63] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L65] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] var_1_6 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L68] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] var_1_8 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L71] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L72] var_1_9 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L73] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L74] var_1_10 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L75] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L76] var_1_11 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L77] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L80] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L80] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L81] var_1_14 = __VERIFIER_nondet_ushort() [L82] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L82] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L83] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L83] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L84] var_1_15 = __VERIFIER_nondet_ushort() [L85] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L85] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L86] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L86] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L87] var_1_16 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L88] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L89] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L89] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=0, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L103] RET updateVariables() [L104] CALL step() [L41] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) [L42] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=-32769, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L43] COND FALSE !(stepLocal_0 > var_1_2) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L46] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L47] COND TRUE ! var_1_13 [L48] var_1_12 = (var_1_3 - (var_1_14 - var_1_15)) VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L104] RET step() [L105] CALL, EXPR property() [L94-L95] return (((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3)))) ; VAL [\result=0, isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] [L19] reach_error() VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_1=32767, var_1_2=32767, var_1_3=-1073610754, var_1_4=-32769, var_1_5=16, var_1_6=1610612735] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 126 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 2223 SizeOfPredicates, 3 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3471/3800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 01:10:54,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9427caecab7d47f6d79e965c4c7e61e381997b7011e11cf9c6567c6c8d4e38d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:10:56,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:10:56,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:10:56,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:10:56,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:10:56,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:10:56,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:10:56,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:10:56,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:10:56,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:10:56,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:10:56,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:10:56,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:10:56,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:10:56,997 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:10:56,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:10:56,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:10:56,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:10:56,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:10:56,999 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:10:56,999 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:10:56,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:10:56,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:10:56,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:10:56,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:10:56,999 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9427caecab7d47f6d79e965c4c7e61e381997b7011e11cf9c6567c6c8d4e38d [2025-02-06 01:10:57,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:10:57,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:10:57,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:10:57,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:10:57,239 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:10:57,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i [2025-02-06 01:10:58,556 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb5f575f0/38cd34c16619464a9fcb7ce3468bb30d/FLAG6e16cb780 [2025-02-06 01:10:58,784 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:10:58,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i [2025-02-06 01:10:58,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb5f575f0/38cd34c16619464a9fcb7ce3468bb30d/FLAG6e16cb780 [2025-02-06 01:10:58,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb5f575f0/38cd34c16619464a9fcb7ce3468bb30d [2025-02-06 01:10:58,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:10:58,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:10:58,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:10:58,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:10:58,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:10:58,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:10:58" (1/1) ... [2025-02-06 01:10:58,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc7b11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:58, skipping insertion in model container [2025-02-06 01:10:58,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:10:58" (1/1) ... [2025-02-06 01:10:58,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:10:58,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i[915,928] [2025-02-06 01:10:58,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:10:58,977 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:10:58,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-38.i[915,928] [2025-02-06 01:10:58,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:10:59,011 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:10:59,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59 WrapperNode [2025-02-06 01:10:59,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:10:59,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:10:59,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:10:59,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:10:59,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,060 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-02-06 01:10:59,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:10:59,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:10:59,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:10:59,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:10:59,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,087 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-02-06 01:10:59,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,094 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:10:59,109 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:10:59,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:10:59,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:10:59,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (1/1) ... [2025-02-06 01:10:59,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:10:59,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:10:59,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:10:59,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:10:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:10:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:10:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:10:59,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:10:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:10:59,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:10:59,238 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:10:59,240 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:11:03,762 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 01:11:03,763 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:11:03,770 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:11:03,770 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:11:03,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:03 BoogieIcfgContainer [2025-02-06 01:11:03,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:11:03,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:11:03,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:11:03,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:11:03,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:10:58" (1/3) ... [2025-02-06 01:11:03,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3382993d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:03, skipping insertion in model container [2025-02-06 01:11:03,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:10:59" (2/3) ... [2025-02-06 01:11:03,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3382993d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:11:03, skipping insertion in model container [2025-02-06 01:11:03,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:11:03" (3/3) ... [2025-02-06 01:11:03,781 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-38.i [2025-02-06 01:11:03,799 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:11:03,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-38.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:11:03,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:11:03,850 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;@5ea3b19b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:11:03,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:11:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:11:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 01:11:03,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:03,866 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:11:03,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:03,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1953460282, now seen corresponding path program 1 times [2025-02-06 01:11:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:11:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094012278] [2025-02-06 01:11:03,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:03,880 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-02-06 01:11:03,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:11:03,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:11:03,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 01:11:03,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:11:04,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:11:04,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:04,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:04,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:11:04,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:11:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-02-06 01:11:04,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:11:04,255 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:11:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094012278] [2025-02-06 01:11:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094012278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:11:04,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:11:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:11:04,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776973411] [2025-02-06 01:11:04,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:11:04,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:11:04,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:11:04,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:11:04,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:11:04,301 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 01:11:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:11:04,316 INFO L93 Difference]: Finished difference Result 105 states and 173 transitions. [2025-02-06 01:11:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:11:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2025-02-06 01:11:04,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:11:04,324 INFO L225 Difference]: With dead ends: 105 [2025-02-06 01:11:04,324 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 01:11:04,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-02-06 01:11:04,331 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:11:04,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:11:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 01:11:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 01:11:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 01:11:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2025-02-06 01:11:04,358 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 124 [2025-02-06 01:11:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:11:04,358 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2025-02-06 01:11:04,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 01:11:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2025-02-06 01:11:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 01:11:04,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:11:04,361 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:11:04,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 01:11:04,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:11:04,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:11:04,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:11:04,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1163438006, now seen corresponding path program 1 times [2025-02-06 01:11:04,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:11:04,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592658504] [2025-02-06 01:11:04,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:11:04,567 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-02-06 01:11:04,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:11:04,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:11:04,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 01:11:04,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 01:11:05,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 01:11:05,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:11:05,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:11:05,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 01:11:05,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:11:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 231 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-06 01:11:31,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:12:01,565 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)