./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-79.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-while_file-79.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 e8e48386f683c61ad83dc45950d416f3b7b34fb83dcb38ff93fba2c7d094f129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:28:12,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:28:12,747 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:28:12,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:28:12,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:28:12,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:28:12,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:28:12,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:28:12,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:28:12,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:28:12,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:28:12,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:28:12,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:28:12,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:28:12,766 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:28:12,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:28:12,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:28:12,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:28:12,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:28:12,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:28:12,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:28:12,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:28:12,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:28:12,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:28:12,769 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:28:12,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:28:12,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:28:12,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:28:12,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:28:12,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:28:12,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:28:12,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:28:12,769 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 -> e8e48386f683c61ad83dc45950d416f3b7b34fb83dcb38ff93fba2c7d094f129 [2025-02-06 01:28:12,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:28:12,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:28:12,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:28:12,978 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:28:12,979 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:28:12,979 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-while_file-79.i [2025-02-06 01:28:14,069 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6571d6c5/2b1da4d2096c42f6830d3f0d9bfcc54c/FLAG4fb8bf081 [2025-02-06 01:28:14,324 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:28:14,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-79.i [2025-02-06 01:28:14,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6571d6c5/2b1da4d2096c42f6830d3f0d9bfcc54c/FLAG4fb8bf081 [2025-02-06 01:28:14,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6571d6c5/2b1da4d2096c42f6830d3f0d9bfcc54c [2025-02-06 01:28:14,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:28:14,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:28:14,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:28:14,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:28:14,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:28:14,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14, skipping insertion in model container [2025-02-06 01:28:14,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:28:14,758 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-while_file-79.i[915,928] [2025-02-06 01:28:14,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:28:14,803 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:28:14,811 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-while_file-79.i[915,928] [2025-02-06 01:28:14,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:28:14,841 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:28:14,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14 WrapperNode [2025-02-06 01:28:14,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:28:14,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:28:14,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:28:14,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:28:14,849 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:28:14" (1/1) ... [2025-02-06 01:28:14,856 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:28:14" (1/1) ... [2025-02-06 01:28:14,879 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2025-02-06 01:28:14,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:28:14,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:28:14,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:28:14,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:28:14,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,902 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:28:14,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:28:14,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:28:14,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:28:14,919 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:28:14,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (1/1) ... [2025-02-06 01:28:14,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:28:14,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:28:14,943 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:28:14,946 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:28:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:28:14,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:28:14,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:28:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:28:14,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:28:14,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:28:15,007 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:28:15,009 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:28:15,188 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 01:28:15,189 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:28:15,197 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:28:15,197 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:28:15,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:28:15 BoogieIcfgContainer [2025-02-06 01:28:15,198 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:28:15,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:28:15,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:28:15,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:28:15,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:28:14" (1/3) ... [2025-02-06 01:28:15,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2be241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:28:15, skipping insertion in model container [2025-02-06 01:28:15,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:14" (2/3) ... [2025-02-06 01:28:15,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2be241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:28:15, skipping insertion in model container [2025-02-06 01:28:15,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:28:15" (3/3) ... [2025-02-06 01:28:15,206 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-79.i [2025-02-06 01:28:15,216 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:28:15,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-79.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:28:15,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:28:15,273 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;@18701fcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:28:15,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:28:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 01:28:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 01:28:15,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:28:15,284 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:15,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:28:15,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:28:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1282327931, now seen corresponding path program 1 times [2025-02-06 01:28:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:28:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340643162] [2025-02-06 01:28:15,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:28:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:28:15,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 01:28:15,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 01:28:15,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:28:15,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:28:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 01:28:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:28:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340643162] [2025-02-06 01:28:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340643162] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:28:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991707363] [2025-02-06 01:28:15,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:28:15,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:28:15,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:28:15,489 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:28:15,490 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:28:15,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 01:28:15,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 01:28:15,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:28:15,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:28:15,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:28:15,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:28:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 01:28:15,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:28:15,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991707363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:28:15,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:28:15,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:28:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735051398] [2025-02-06 01:28:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:28:15,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:28:15,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:28:15,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:28:15,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:28:15,640 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 01:28:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:28:15,653 INFO L93 Difference]: Finished difference Result 86 states and 140 transitions. [2025-02-06 01:28:15,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:28:15,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2025-02-06 01:28:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:28:15,657 INFO L225 Difference]: With dead ends: 86 [2025-02-06 01:28:15,657 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 01:28:15,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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:28:15,661 INFO L435 NwaCegarLoop]: 61 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, 61 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:28:15,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:28:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 01:28:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 01:28:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 01:28:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-02-06 01:28:15,684 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 86 [2025-02-06 01:28:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:28:15,685 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-02-06 01:28:15,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 01:28:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-02-06 01:28:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 01:28:15,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:28:15,687 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:15,697 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:28:15,891 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:28:15,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:28:15,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:28:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1467173824, now seen corresponding path program 1 times [2025-02-06 01:28:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:28:15,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699607403] [2025-02-06 01:28:15,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:28:15,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:28:15,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 01:28:15,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 01:28:15,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:28:15,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:28:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 01:28:16,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:28:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699607403] [2025-02-06 01:28:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699607403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:28:16,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:28:16,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:28:16,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98065416] [2025-02-06 01:28:16,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:28:16,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:28:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:28:16,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:28:16,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:28:16,015 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 01:28:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:28:16,046 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2025-02-06 01:28:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:28:16,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2025-02-06 01:28:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:28:16,047 INFO L225 Difference]: With dead ends: 94 [2025-02-06 01:28:16,047 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 01:28:16,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:28:16,048 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:28:16,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 112 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:28:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 01:28:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2025-02-06 01:28:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 01:28:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-02-06 01:28:16,054 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 86 [2025-02-06 01:28:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:28:16,054 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-02-06 01:28:16,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 01:28:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-02-06 01:28:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 01:28:16,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:28:16,056 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:16,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:28:16,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:28:16,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:28:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1612705977, now seen corresponding path program 1 times [2025-02-06 01:28:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:28:16,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162665499] [2025-02-06 01:28:16,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:28:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:28:16,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 01:28:16,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 01:28:16,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:28:16,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:28:16,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:28:16,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 01:28:16,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 01:28:16,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:28:16,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:28:16,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:28:16,237 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:28:16,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:28:16,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:28:16,241 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 01:28:16,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:28:16,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:28:16 BoogieIcfgContainer [2025-02-06 01:28:16,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:28:16,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:28:16,276 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:28:16,276 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:28:16,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:28:15" (3/4) ... [2025-02-06 01:28:16,278 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:28:16,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:28:16,279 INFO L158 Benchmark]: Toolchain (without parser) took 1635.90ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 117.5MB in the end (delta: 12.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-02-06 01:28:16,279 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:28:16,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.16ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 117.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:28:16,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.68ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 115.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:28:16,280 INFO L158 Benchmark]: Boogie Preprocessor took 38.02ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 113.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:28:16,280 INFO L158 Benchmark]: IcfgBuilder took 278.93ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 98.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:28:16,281 INFO L158 Benchmark]: TraceAbstraction took 1075.41ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 117.5MB in the end (delta: -18.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:28:16,281 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 117.5MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:28:16,282 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.20ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.16ms. Allocated memory is still 167.8MB. Free memory was 130.0MB in the beginning and 117.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.68ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 115.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.02ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 113.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.93ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 98.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1075.41ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 117.5MB in the end (delta: -18.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 117.5MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = 0; [L25] signed char var_1_4 = 64; [L26] signed char var_1_5 = 64; [L27] unsigned short int var_1_6 = 25; [L28] float var_1_7 = 256.4; [L29] double var_1_10 = 9999999999.515; [L30] float var_1_11 = 8.5; [L31] float var_1_12 = 2.5; [L32] double var_1_13 = 15.8; [L33] double var_1_14 = 25.8; VAL [isInitial=0, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=1, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L67] var_1_3 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L68] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L69] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L69] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=64, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L70] var_1_4 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L71] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L72] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L72] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=64, var_1_6=25, var_1_7=1282/5] [L73] var_1_5 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L74] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L75] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L75] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25, var_1_7=1282/5] [L76] var_1_7 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L77] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_11=17/2, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L78] var_1_11 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L79] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_12=5/2, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L80] var_1_12 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L81] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_13=79/5, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L83] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_14=129/5, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L85] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L98] RET updateVariables() [L99] CALL step() [L37] COND TRUE ! var_1_2 VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-16, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L38] COND TRUE ! var_1_2 [L39] var_1_1 = (var_1_3 + -32) VAL [isInitial=1, var_1_10=1999999999903/200, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L44] COND FALSE !(var_1_7 < (var_1_11 - var_1_12)) [L51] var_1_10 = var_1_14 VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=25] [L53] COND FALSE !(\read(var_1_2)) [L60] var_1_6 = 16 VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=16] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return (((! var_1_2) ? ((! var_1_2) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - var_1_5)))) : 1) && (var_1_2 ? (((var_1_7 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) <= var_1_10) ? (var_1_6 == ((unsigned short int) ((((256) < 0 ) ? -(256) : (256))))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) 16)))) && ((var_1_7 < (var_1_11 - var_1_12)) ? (((var_1_7 / 7.2) <= var_1_11) ? (var_1_10 == ((double) (var_1_13 - var_1_14))) : (var_1_10 == ((double) var_1_13))) : (var_1_10 == ((double) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=16] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=16] [L19] reach_error() VAL [isInitial=1, var_1_10=10000000004, var_1_14=10000000004, var_1_1=-95, var_1_2=0, var_1_3=-63, var_1_4=126, var_1_5=0, var_1_6=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 126 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 912/936 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:28:16,297 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-while_file-79.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 e8e48386f683c61ad83dc45950d416f3b7b34fb83dcb38ff93fba2c7d094f129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:28:18,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:28:18,227 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:28:18,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:28:18,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:28:18,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:28:18,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:28:18,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:28:18,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:28:18,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:28:18,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:28:18,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:28:18,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:28:18,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:28:18,258 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:28:18,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:28:18,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:28:18,259 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:28:18,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:28:18,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:28:18,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:28:18,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:28:18,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:28:18,259 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:28:18,260 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:28:18,260 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:28:18,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:28:18,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:28:18,260 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:28:18,260 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:28:18,260 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:28:18,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:28:18,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:28:18,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:28:18,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:28:18,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:28:18,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:28:18,261 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:28:18,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:28:18,261 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:28:18,261 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:28:18,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:28:18,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:28:18,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:28:18,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:28:18,262 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 -> e8e48386f683c61ad83dc45950d416f3b7b34fb83dcb38ff93fba2c7d094f129 [2025-02-06 01:28:18,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:28:18,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:28:18,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:28:18,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:28:18,512 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:28:18,513 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-while_file-79.i [2025-02-06 01:28:19,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f08260df/350603c25e10439e9a78cb5772d21c1c/FLAGb1a40bc85 [2025-02-06 01:28:19,878 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:28:19,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-79.i [2025-02-06 01:28:19,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f08260df/350603c25e10439e9a78cb5772d21c1c/FLAGb1a40bc85 [2025-02-06 01:28:19,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f08260df/350603c25e10439e9a78cb5772d21c1c [2025-02-06 01:28:19,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:28:19,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:28:19,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:28:19,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:28:19,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:28:19,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:28:19" (1/1) ... [2025-02-06 01:28:19,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc40504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:19, skipping insertion in model container [2025-02-06 01:28:19,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:28:19" (1/1) ... [2025-02-06 01:28:19,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:28:20,022 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-while_file-79.i[915,928] [2025-02-06 01:28:20,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:28:20,080 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:28:20,088 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-while_file-79.i[915,928] [2025-02-06 01:28:20,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:28:20,121 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:28:20,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20 WrapperNode [2025-02-06 01:28:20,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:28:20,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:28:20,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:28:20,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:28:20,128 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:28:20" (1/1) ... [2025-02-06 01:28:20,134 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:28:20" (1/1) ... [2025-02-06 01:28:20,153 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-02-06 01:28:20,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:28:20,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:28:20,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:28:20,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:28:20,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,174 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:28:20,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:28:20,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:28:20,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:28:20,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:28:20,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (1/1) ... [2025-02-06 01:28:20,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:28:20,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:28:20,218 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:28:20,220 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:28:20,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:28:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:28:20,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:28:20,240 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:28:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:28:20,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:28:20,286 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:28:20,287 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:28:34,722 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 01:28:34,723 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:28:34,729 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:28:34,729 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:28:34,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:28:34 BoogieIcfgContainer [2025-02-06 01:28:34,729 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:28:34,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:28:34,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:28:34,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:28:34,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:28:19" (1/3) ... [2025-02-06 01:28:34,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34aa1cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:28:34, skipping insertion in model container [2025-02-06 01:28:34,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:28:20" (2/3) ... [2025-02-06 01:28:34,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34aa1cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:28:34, skipping insertion in model container [2025-02-06 01:28:34,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:28:34" (3/3) ... [2025-02-06 01:28:34,735 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-79.i [2025-02-06 01:28:34,744 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:28:34,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-79.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:28:34,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:28:34,795 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;@39d8a8e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:28:34,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:28:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 01:28:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 01:28:34,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:28:34,806 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:34,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:28:34,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:28:34,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1282327931, now seen corresponding path program 1 times [2025-02-06 01:28:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:28:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057378528] [2025-02-06 01:28:34,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:28:34,821 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:28:34,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:28:34,825 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:28:34,826 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:28:34,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 01:28:35,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 01:28:35,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:28:35,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:28:35,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:28:35,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:28:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-02-06 01:28:35,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:28:35,767 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:28:35,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057378528] [2025-02-06 01:28:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057378528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:28:35,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:28:35,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:28:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297380900] [2025-02-06 01:28:35,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:28:35,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:28:35,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:28:35,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:28:35,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:28:35,793 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 01:28:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:28:35,809 INFO L93 Difference]: Finished difference Result 86 states and 140 transitions. [2025-02-06 01:28:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:28:35,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2025-02-06 01:28:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:28:35,814 INFO L225 Difference]: With dead ends: 86 [2025-02-06 01:28:35,814 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 01:28:35,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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:28:35,819 INFO L435 NwaCegarLoop]: 61 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, 61 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:28:35,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:28:35,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 01:28:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 01:28:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 01:28:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-02-06 01:28:35,844 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 86 [2025-02-06 01:28:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:28:35,844 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-02-06 01:28:35,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 01:28:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-02-06 01:28:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 01:28:35,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:28:35,847 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:35,871 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-06 01:28:36,050 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:28:36,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:28:36,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:28:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1467173824, now seen corresponding path program 1 times [2025-02-06 01:28:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:28:36,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796143366] [2025-02-06 01:28:36,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:28:36,053 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:28:36,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:28:36,055 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:28:36,058 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:28:36,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 01:28:36,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 01:28:36,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:28:36,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:28:36,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 01:28:36,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:28:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 01:28:36,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:28:36,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:28:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796143366] [2025-02-06 01:28:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796143366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:28:36,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:28:36,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:28:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8832894] [2025-02-06 01:28:36,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:28:36,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:28:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:28:36,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:28:36,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:28:36,983 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 01:28:41,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:28:45,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:28:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:28:45,432 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2025-02-06 01:28:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:28:45,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2025-02-06 01:28:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:28:45,539 INFO L225 Difference]: With dead ends: 94 [2025-02-06 01:28:45,539 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 01:28:45,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:28:45,540 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:28:45,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 111 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-02-06 01:28:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 01:28:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2025-02-06 01:28:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 01:28:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2025-02-06 01:28:45,556 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 86 [2025-02-06 01:28:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:28:45,558 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2025-02-06 01:28:45,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 01:28:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2025-02-06 01:28:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 01:28:45,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:28:45,563 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:45,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 01:28:45,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:28:45,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:28:45,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:28:45,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1612705977, now seen corresponding path program 1 times [2025-02-06 01:28:45,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:28:45,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388243954] [2025-02-06 01:28:45,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:28:45,766 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:28:45,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:28:45,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:28:45,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 01:28:45,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 01:28:46,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 01:28:46,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:28:46,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:28:46,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 01:28:46,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:29:10,421 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:29:22,971 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:29:36,051 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:29:48,574 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)