./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.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_100-1loop_file-9.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 cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:53:15,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:53:15,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:53:15,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:53:15,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:53:15,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:53:15,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:53:15,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:53:15,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:53:15,955 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:53:15,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:53:15,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:53:15,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:53:15,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:53:15,956 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:53:15,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:53:15,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:53:15,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:53:15,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:53:15,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:53:15,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:53:15,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:53:15,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:53:15,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:53:15,957 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:53:15,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:53:15,957 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:53:15,957 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:53:15,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:53:15,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:53:15,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:53:15,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:53:15,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:53:15,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:53:15,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:53:15,959 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:53:15,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:53:15,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:53:15,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:53:15,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:53:15,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:53:15,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:53:15,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:53:15,959 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 -> cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 [2025-02-06 00:53:16,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:53:16,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:53:16,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:53:16,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:53:16,213 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:53:16,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2025-02-06 00:53:17,358 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d614fcab9/c412fd0d2d11463fa764f002a2ac8e93/FLAGc792e9689 [2025-02-06 00:53:17,570 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:53:17,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2025-02-06 00:53:17,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d614fcab9/c412fd0d2d11463fa764f002a2ac8e93/FLAGc792e9689 [2025-02-06 00:53:17,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d614fcab9/c412fd0d2d11463fa764f002a2ac8e93 [2025-02-06 00:53:17,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:53:17,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:53:17,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:53:17,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:53:17,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:53:17,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:53:17" (1/1) ... [2025-02-06 00:53:17,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb74559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:17, skipping insertion in model container [2025-02-06 00:53:17,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:53:17" (1/1) ... [2025-02-06 00:53:17,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:53:18,028 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_100-1loop_file-9.i[915,928] [2025-02-06 00:53:18,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:53:18,091 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:53:18,098 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_100-1loop_file-9.i[915,928] [2025-02-06 00:53:18,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:53:18,138 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:53:18,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18 WrapperNode [2025-02-06 00:53:18,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:53:18,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:53:18,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:53:18,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:53:18,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,196 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2025-02-06 00:53:18,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:53:18,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:53:18,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:53:18,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:53:18,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,232 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 00:53:18,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:53:18,256 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:53:18,256 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:53:18,256 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:53:18,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (1/1) ... [2025-02-06 00:53:18,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:53:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:53:18,283 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 00:53:18,287 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 00:53:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:53:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:53:18,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:53:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:53:18,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:53:18,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:53:18,361 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:53:18,363 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:53:18,840 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc property_#t~ite22#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-02-06 00:53:18,870 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-06 00:53:18,870 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:53:18,889 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:53:18,891 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:53:18,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:53:18 BoogieIcfgContainer [2025-02-06 00:53:18,892 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:53:18,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:53:18,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:53:18,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:53:18,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:53:17" (1/3) ... [2025-02-06 00:53:18,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19648f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:53:18, skipping insertion in model container [2025-02-06 00:53:18,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:18" (2/3) ... [2025-02-06 00:53:18,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19648f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:53:18, skipping insertion in model container [2025-02-06 00:53:18,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:53:18" (3/3) ... [2025-02-06 00:53:18,901 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-9.i [2025-02-06 00:53:18,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:53:18,917 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-9.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:53:18,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:53:18,978 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;@2bc7fd73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:53:18,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:53:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:53:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 00:53:18,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:53:18,996 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:18,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:53:19,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:53:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash 529490361, now seen corresponding path program 1 times [2025-02-06 00:53:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:53:19,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813357206] [2025-02-06 00:53:19,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:19,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:53:19,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 00:53:19,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 00:53:19,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:19,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:53:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 00:53:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:53:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813357206] [2025-02-06 00:53:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813357206] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:53:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568552236] [2025-02-06 00:53:19,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:19,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:53:19,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:53:19,309 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 00:53:19,311 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 00:53:19,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 00:53:19,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 00:53:19,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:19,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:53:19,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:53:19,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:53:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 00:53:19,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:53:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568552236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:53:19,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:53:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:53:19,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311548396] [2025-02-06 00:53:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:53:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:53:19,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:53:19,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:53:19,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:53:19,519 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 00:53:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:53:19,548 INFO L93 Difference]: Finished difference Result 210 states and 359 transitions. [2025-02-06 00:53:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:53:19,550 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-02-06 00:53:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:53:19,557 INFO L225 Difference]: With dead ends: 210 [2025-02-06 00:53:19,557 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 00:53:19,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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 00:53:19,561 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:53:19,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:53:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 00:53:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-06 00:53:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:53:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 158 transitions. [2025-02-06 00:53:19,591 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 158 transitions. Word has length 171 [2025-02-06 00:53:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:53:19,591 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 158 transitions. [2025-02-06 00:53:19,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 00:53:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 158 transitions. [2025-02-06 00:53:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 00:53:19,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:53:19,597 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:19,606 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 00:53:19,798 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 00:53:19,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:53:19,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:53:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1878834965, now seen corresponding path program 1 times [2025-02-06 00:53:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:53:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003623829] [2025-02-06 00:53:19,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:19,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:53:19,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 00:53:19,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 00:53:19,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:19,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:53:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 00:53:20,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:53:20,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003623829] [2025-02-06 00:53:20,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003623829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:53:20,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:53:20,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:53:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14302087] [2025-02-06 00:53:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:53:20,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:53:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:53:20,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:53:20,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:53:20,048 INFO L87 Difference]: Start difference. First operand 103 states and 158 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:53:20,157 INFO L93 Difference]: Finished difference Result 247 states and 376 transitions. [2025-02-06 00:53:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:53:20,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-02-06 00:53:20,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:53:20,159 INFO L225 Difference]: With dead ends: 247 [2025-02-06 00:53:20,159 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 00:53:20,160 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 00:53:20,161 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 75 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:53:20,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 304 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:53:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 00:53:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2025-02-06 00:53:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 114 states have internal predecessors, (157), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 00:53:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2025-02-06 00:53:20,173 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 171 [2025-02-06 00:53:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:53:20,173 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2025-02-06 00:53:20,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2025-02-06 00:53:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 00:53:20,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:53:20,178 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:20,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:53:20,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:53:20,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:53:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash -93838855, now seen corresponding path program 1 times [2025-02-06 00:53:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:53:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870819726] [2025-02-06 00:53:20,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:53:20,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 00:53:20,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 00:53:20,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:20,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:53:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 00:53:20,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:53:20,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870819726] [2025-02-06 00:53:20,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870819726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:53:20,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:53:20,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:53:20,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833053735] [2025-02-06 00:53:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:53:20,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:53:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:53:20,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:53:20,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:53:20,362 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:53:20,534 INFO L93 Difference]: Finished difference Result 420 states and 626 transitions. [2025-02-06 00:53:20,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:53:20,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-02-06 00:53:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:53:20,538 INFO L225 Difference]: With dead ends: 420 [2025-02-06 00:53:20,538 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 00:53:20,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:53:20,540 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 121 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:53:20,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 443 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:53:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 00:53:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2025-02-06 00:53:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.335820895522388) internal successors, (179), 135 states have internal predecessors, (179), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 00:53:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 287 transitions. [2025-02-06 00:53:20,566 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 287 transitions. Word has length 172 [2025-02-06 00:53:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:53:20,567 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 287 transitions. [2025-02-06 00:53:20,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 287 transitions. [2025-02-06 00:53:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 00:53:20,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:53:20,572 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:20,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:53:20,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:53:20,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:53:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 920871158, now seen corresponding path program 1 times [2025-02-06 00:53:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:53:20,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370656465] [2025-02-06 00:53:20,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:53:20,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 00:53:20,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 00:53:20,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:53:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 00:53:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:53:20,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370656465] [2025-02-06 00:53:20,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370656465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:53:20,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:53:20,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:53:20,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680527297] [2025-02-06 00:53:20,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:53:20,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:53:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:53:20,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:53:20,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:53:20,725 INFO L87 Difference]: Start difference. First operand 192 states and 287 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:53:20,777 INFO L93 Difference]: Finished difference Result 474 states and 707 transitions. [2025-02-06 00:53:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:53:20,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-02-06 00:53:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:53:20,783 INFO L225 Difference]: With dead ends: 474 [2025-02-06 00:53:20,784 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 00:53:20,785 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 00:53:20,786 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 104 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:53:20,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 355 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:53:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 00:53:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2025-02-06 00:53:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 243 states have (on average 1.3497942386831276) internal successors, (328), 245 states have internal predecessors, (328), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 00:53:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 492 transitions. [2025-02-06 00:53:20,834 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 492 transitions. Word has length 173 [2025-02-06 00:53:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:53:20,834 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 492 transitions. [2025-02-06 00:53:20,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 492 transitions. [2025-02-06 00:53:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 00:53:20,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:53:20,836 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:20,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:53:20,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:53:20,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:53:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2042472456, now seen corresponding path program 1 times [2025-02-06 00:53:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:53:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122496675] [2025-02-06 00:53:20,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:53:20,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 00:53:20,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 00:53:20,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:20,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:53:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 00:53:20,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:53:20,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122496675] [2025-02-06 00:53:20,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122496675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:53:20,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:53:20,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:53:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856904893] [2025-02-06 00:53:20,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:53:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:53:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:53:20,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:53:20,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:53:20,936 INFO L87 Difference]: Start difference. First operand 331 states and 492 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:53:20,999 INFO L93 Difference]: Finished difference Result 474 states and 703 transitions. [2025-02-06 00:53:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:53:21,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-02-06 00:53:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:53:21,003 INFO L225 Difference]: With dead ends: 474 [2025-02-06 00:53:21,003 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 00:53:21,006 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 00:53:21,011 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 151 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:53:21,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 445 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:53:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 00:53:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2025-02-06 00:53:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 243 states have (on average 1.3415637860082306) internal successors, (326), 245 states have internal predecessors, (326), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 00:53:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 490 transitions. [2025-02-06 00:53:21,046 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 490 transitions. Word has length 174 [2025-02-06 00:53:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:53:21,047 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 490 transitions. [2025-02-06 00:53:21,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 490 transitions. [2025-02-06 00:53:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 00:53:21,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:53:21,048 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:21,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:53:21,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:53:21,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:53:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash 442927183, now seen corresponding path program 1 times [2025-02-06 00:53:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:53:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236263999] [2025-02-06 00:53:21,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:53:21,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 00:53:21,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 00:53:21,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:21,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 00:53:21,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642822953] [2025-02-06 00:53:21,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:21,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:53:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:53:21,232 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:53:21,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:53:21,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 00:53:21,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 00:53:21,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:21,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:53:21,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:53:21,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 00:53:21,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 00:53:21,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:21,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:53:21,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:53:21,527 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:53:21,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:53:21,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 00:53:21,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:53:21,733 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 00:53:21,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:53:21,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:53:21 BoogieIcfgContainer [2025-02-06 00:53:21,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:53:21,845 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:53:21,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:53:21,845 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:53:21,846 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:53:18" (3/4) ... [2025-02-06 00:53:21,848 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:53:21,849 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:53:21,850 INFO L158 Benchmark]: Toolchain (without parser) took 3934.23ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 56.9MB in the end (delta: 65.3MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2025-02-06 00:53:21,850 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:53:21,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.16ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 105.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 00:53:21,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.00ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 98.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:53:21,852 INFO L158 Benchmark]: Boogie Preprocessor took 58.28ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 92.0MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:53:21,852 INFO L158 Benchmark]: IcfgBuilder took 636.32ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 51.1MB in the end (delta: 40.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 00:53:21,852 INFO L158 Benchmark]: TraceAbstraction took 2950.12ms. Allocated memory is still 167.8MB. Free memory was 50.0MB in the beginning and 56.9MB in the end (delta: -6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:53:21,852 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 167.8MB. Free memory was 56.9MB in the beginning and 56.9MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:53:21,853 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.16ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 105.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.00ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 98.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.28ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 92.0MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 636.32ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 51.1MB in the end (delta: 40.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2950.12ms. Allocated memory is still 167.8MB. Free memory was 50.0MB in the beginning and 56.9MB in the end (delta: -6.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 167.8MB. Free memory was 56.9MB in the beginning and 56.9MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 154. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] double var_1_4 = 99999999999.6; [L24] unsigned char var_1_5 = 1; [L25] signed long int var_1_6 = -5; [L26] signed char var_1_10 = 64; [L27] signed char var_1_11 = 16; [L28] signed char var_1_12 = 4; [L29] signed char var_1_13 = 64; [L30] unsigned short int var_1_14 = 64; [L31] unsigned char var_1_16 = 8; [L32] unsigned char var_1_17 = 200; [L33] unsigned char var_1_18 = 1; [L34] signed long int var_1_19 = 10; [L35] signed long int var_1_20 = -256; [L36] signed char var_1_21 = 25; [L37] signed char var_1_23 = 1; [L38] signed char var_1_24 = 5; [L39] unsigned char var_1_25 = 0; [L40] double var_1_26 = 8.125; [L41] double var_1_27 = 0.875; [L42] double var_1_28 = 15.6; [L43] double var_1_29 = 2.5; [L44] unsigned long int var_1_30 = 25; [L45] signed long int var_1_31 = 50; [L46] signed short int var_1_32 = -8; [L47] unsigned char var_1_33 = 100; [L48] signed long int last_1_var_1_6 = -5; [L49] signed long int last_1_var_1_20 = -256; [L50] signed char last_1_var_1_21 = 25; VAL [isInitial=0, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L203] isInitial = 1 [L204] FCALL initially() [L205] int k_loop; [L206] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L206] COND TRUE k_loop < 1 [L207] CALL updateLastVariables() [L194] last_1_var_1_6 = var_1_6 [L195] last_1_var_1_20 = var_1_20 [L196] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L153] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L155] var_1_5 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L156] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L157] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L157] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L158] var_1_11 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L159] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L161] var_1_12 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L162] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L164] var_1_13 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L167] var_1_17 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_17 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L168] RET assume_abort_if_not(var_1_17 >= 190) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L170] var_1_18 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L171] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L173] var_1_23 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L174] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L176] var_1_24 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L177] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L182] var_1_27 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L183] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L184] var_1_28 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L185] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L186] var_1_29 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L187] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L188] var_1_31 = __VERIFIER_nondet_long() [L189] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L189] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] CALL assume_abort_if_not(var_1_31 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] RET assume_abort_if_not(var_1_31 != 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L208] RET updateVariables() [L209] CALL step() [L54] COND TRUE \read(var_1_5) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L55] COND TRUE (last_1_var_1_6 < 1) || var_1_25 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L56] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L65] COND FALSE !((- var_1_26) >= (var_1_26 / var_1_4)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L70] var_1_32 = var_1_23 [L71] var_1_33 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L72] COND FALSE !(! var_1_5) [L87] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L89] COND FALSE !(var_1_1 == 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L92] COND FALSE !(var_1_14 < var_1_1) [L95] var_1_6 = var_1_1 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L98] unsigned short int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L99] COND FALSE !(! var_1_5) [L104] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L106] var_1_19 = var_1_16 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=25, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L107] COND FALSE !(((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) [L114] var_1_30 = var_1_33 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L116] COND TRUE \read(var_1_5) [L117] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L125] COND TRUE \read(var_1_5) [L126] var_1_20 = -10000000 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L142] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L143] EXPR last_1_var_1_21 & var_1_10 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L143] COND TRUE ((last_1_var_1_21 & var_1_10) >= var_1_12) && stepLocal_1 [L144] var_1_21 = (var_1_18 + (var_1_23 - var_1_24)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L209] RET step() [L210] CALL, EXPR property() [L199] EXPR ((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14)))) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L199] EXPR (((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L199-L200] return (((((((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1))) && (var_1_5 ? (((last_1_var_1_6 < 1) || var_1_25) ? (var_1_25 ? (var_1_26 == ((double) ((var_1_27 - var_1_28) + var_1_29))) : 1) : (var_1_26 == ((double) var_1_28))) : (var_1_26 == ((double) var_1_28)))) && ((((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) ? ((var_1_16 > var_1_16) ? (var_1_30 == ((unsigned long int) var_1_18)) : (var_1_30 == ((unsigned long int) var_1_17))) : (var_1_30 == ((unsigned long int) var_1_33)))) && (var_1_32 == ((signed short int) var_1_23))) && (var_1_33 == ((unsigned char) var_1_18)) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=126, var_1_14=126, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_30=33, var_1_31=63, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 1704 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 694 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 1010 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 94 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1380 NumberOfCodeBlocks, 1380 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1026 ConstructedInterpolants, 0 QuantifiedInterpolants, 1432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 405 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 7750/7800 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 00:53:21,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_100-1loop_file-9.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 cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:53:23,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:53:23,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:53:23,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:53:23,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:53:23,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:53:23,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:53:23,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:53:23,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:53:23,894 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:53:23,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:53:23,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:53:23,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:53:23,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:53:23,894 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:53:23,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:53:23,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:53:23,895 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:53:23,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:53:23,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:53:23,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:53:23,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:53:23,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:53:23,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:53:23,896 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:53:23,896 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:53:23,896 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:53:23,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:53:23,896 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:53:23,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:53:23,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:53:23,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:53:23,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:53:23,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:53:23,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:53:23,898 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 -> cc35118ba1a0e6d4f6fbfe0c13fd86d864ebc4499fb9e1bc8f8aa547d2c12872 [2025-02-06 00:53:24,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:53:24,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:53:24,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:53:24,183 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:53:24,183 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:53:24,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2025-02-06 00:53:25,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d6305874/a4630cde8f96404b9b404756df2f076a/FLAG9a20ae91d [2025-02-06 00:53:25,584 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:53:25,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-9.i [2025-02-06 00:53:25,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d6305874/a4630cde8f96404b9b404756df2f076a/FLAG9a20ae91d [2025-02-06 00:53:25,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d6305874/a4630cde8f96404b9b404756df2f076a [2025-02-06 00:53:25,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:53:25,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:53:25,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:53:25,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:53:25,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:53:25,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25, skipping insertion in model container [2025-02-06 00:53:25,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:53:25,744 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_100-1loop_file-9.i[915,928] [2025-02-06 00:53:25,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:53:25,832 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:53:25,839 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_100-1loop_file-9.i[915,928] [2025-02-06 00:53:25,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:53:25,886 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:53:25,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25 WrapperNode [2025-02-06 00:53:25,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:53:25,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:53:25,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:53:25,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:53:25,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,934 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-02-06 00:53:25,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:53:25,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:53:25,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:53:25,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:53:25,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,963 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 00:53:25,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:53:25,990 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:53:25,990 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:53:25,990 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:53:25,992 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (1/1) ... [2025-02-06 00:53:25,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:53:26,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:53:26,017 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 00:53:26,020 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 00:53:26,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:53:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:53:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:53:26,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:53:26,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:53:26,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:53:26,111 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:53:26,113 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:53:36,969 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 00:53:36,970 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:53:36,976 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:53:36,977 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:53:36,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:53:36 BoogieIcfgContainer [2025-02-06 00:53:36,977 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:53:36,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:53:36,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:53:36,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:53:36,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:53:25" (1/3) ... [2025-02-06 00:53:36,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56195695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:53:36, skipping insertion in model container [2025-02-06 00:53:36,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:53:25" (2/3) ... [2025-02-06 00:53:36,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56195695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:53:36, skipping insertion in model container [2025-02-06 00:53:36,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:53:36" (3/3) ... [2025-02-06 00:53:36,985 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-9.i [2025-02-06 00:53:36,994 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:53:36,996 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-9.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:53:37,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:53:37,041 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;@363eb65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:53:37,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:53:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:53:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-06 00:53:37,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:53:37,054 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:37,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:53:37,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:53:37,059 INFO L85 PathProgramCache]: Analyzing trace with hash 661637997, now seen corresponding path program 1 times [2025-02-06 00:53:37,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:53:37,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363157189] [2025-02-06 00:53:37,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:37,067 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 00:53:37,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:53:37,070 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 00:53:37,071 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 00:53:37,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 00:53:37,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 00:53:37,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:37,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:53:37,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:53:37,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:53:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-02-06 00:53:37,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:53:37,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:53:37,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363157189] [2025-02-06 00:53:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363157189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:53:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:53:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:53:37,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837287367] [2025-02-06 00:53:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:53:37,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:53:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:53:37,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:53:37,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:53:37,969 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 00:53:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:53:37,986 INFO L93 Difference]: Finished difference Result 166 states and 291 transitions. [2025-02-06 00:53:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:53:37,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2025-02-06 00:53:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:53:37,993 INFO L225 Difference]: With dead ends: 166 [2025-02-06 00:53:37,993 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 00:53:37,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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 00:53:38,002 INFO L435 NwaCegarLoop]: 127 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, 127 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 00:53:38,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:53:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 00:53:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 00:53:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:53:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-02-06 00:53:38,038 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 166 [2025-02-06 00:53:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:53:38,038 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-02-06 00:53:38,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 00:53:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-02-06 00:53:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-06 00:53:38,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:53:38,044 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:38,067 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 00:53:38,245 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 00:53:38,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:53:38,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:53:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash 209486993, now seen corresponding path program 1 times [2025-02-06 00:53:38,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:53:38,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210283444] [2025-02-06 00:53:38,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:38,246 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 00:53:38,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:53:38,248 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 00:53:38,249 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 00:53:38,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 00:53:39,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 00:53:39,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:39,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:53:39,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 00:53:39,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:53:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 00:53:39,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:53:39,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:53:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210283444] [2025-02-06 00:53:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210283444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:53:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:53:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:53:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982990553] [2025-02-06 00:53:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:53:39,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:53:39,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:53:39,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:53:39,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:53:39,374 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:43,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:53:47,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:53:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:53:47,917 INFO L93 Difference]: Finished difference Result 190 states and 288 transitions. [2025-02-06 00:53:47,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:53:47,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2025-02-06 00:53:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:53:47,919 INFO L225 Difference]: With dead ends: 190 [2025-02-06 00:53:47,919 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 00:53:47,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 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 00:53:47,920 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 39 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:53:47,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 245 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-02-06 00:53:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 00:53:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2025-02-06 00:53:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 79 states have internal predecessors, (104), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 00:53:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2025-02-06 00:53:47,936 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 166 [2025-02-06 00:53:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:53:47,936 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2025-02-06 00:53:47,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2025-02-06 00:53:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 00:53:47,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:53:47,951 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:47,971 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 00:53:48,151 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 00:53:48,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:53:48,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:53:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash -538990522, now seen corresponding path program 1 times [2025-02-06 00:53:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:53:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72523008] [2025-02-06 00:53:48,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:53:48,153 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 00:53:48,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:53:48,155 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 00:53:48,155 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 00:53:48,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 00:53:48,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 00:53:48,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:53:48,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:53:48,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 00:53:48,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:53:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 00:53:52,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:53:52,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:53:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72523008] [2025-02-06 00:53:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72523008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:53:52,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:53:52,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:53:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992951468] [2025-02-06 00:53:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:53:52,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:53:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:53:52,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:53:52,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:53:52,556 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:53:57,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:54:01,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:54:05,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:54:09,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:54:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:54:09,492 INFO L93 Difference]: Finished difference Result 315 states and 467 transitions. [2025-02-06 00:54:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:54:09,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2025-02-06 00:54:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:54:09,584 INFO L225 Difference]: With dead ends: 315 [2025-02-06 00:54:09,584 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 00:54:09,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:54:09,585 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 84 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 53 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-02-06 00:54:09,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 355 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2025-02-06 00:54:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 00:54:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 157. [2025-02-06 00:54:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 100 states have internal predecessors, (126), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 00:54:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2025-02-06 00:54:09,607 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 167 [2025-02-06 00:54:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:54:09,608 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2025-02-06 00:54:09,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:54:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2025-02-06 00:54:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 00:54:09,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:54:09,610 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:54:09,633 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 (4)] Ended with exit code 0 [2025-02-06 00:54:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 00:54:09,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:54:09,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:54:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash -678609105, now seen corresponding path program 1 times [2025-02-06 00:54:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:54:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543990082] [2025-02-06 00:54:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:54:09,811 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 00:54:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:54:09,813 INFO L229 MonitoredProcess]: Starting monitored process 5 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 00:54:09,814 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 (5)] Waiting until timeout for monitored process [2025-02-06 00:54:09,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 00:54:10,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 00:54:10,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:54:10,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:54:10,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 00:54:10,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:54:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 00:54:14,166 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:54:14,166 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:54:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543990082] [2025-02-06 00:54:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543990082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:54:14,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:54:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:54:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257741623] [2025-02-06 00:54:14,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:54:14,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:54:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:54:14,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:54:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:54:14,168 INFO L87 Difference]: Start difference. First operand 157 states and 234 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:54:18,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:54:22,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:54:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:54:22,509 INFO L93 Difference]: Finished difference Result 369 states and 548 transitions. [2025-02-06 00:54:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:54:22,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-02-06 00:54:22,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:54:22,618 INFO L225 Difference]: With dead ends: 369 [2025-02-06 00:54:22,618 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 00:54:22,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 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 00:54:22,619 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 41 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:54:22,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 265 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-06 00:54:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 00:54:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-02-06 00:54:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 173 states have (on average 1.283236994219653) internal successors, (222), 175 states have internal predecessors, (222), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 00:54:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2025-02-06 00:54:22,669 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 168 [2025-02-06 00:54:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:54:22,671 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2025-02-06 00:54:22,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:54:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2025-02-06 00:54:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 00:54:22,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:54:22,673 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:54:22,704 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 (5)] Ended with exit code 0 [2025-02-06 00:54:22,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 00:54:22,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:54:22,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:54:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash -889762392, now seen corresponding path program 1 times [2025-02-06 00:54:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:54:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072847252] [2025-02-06 00:54:22,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:54:22,875 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 00:54:22,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:54:22,877 INFO L229 MonitoredProcess]: Starting monitored process 6 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 00:54:22,878 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 (6)] Waiting until timeout for monitored process [2025-02-06 00:54:22,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 00:54:23,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 00:54:23,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:54:23,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:54:23,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 00:54:23,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:54:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 00:54:23,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:54:23,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:54:23,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072847252] [2025-02-06 00:54:23,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072847252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:54:23,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:54:23,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:54:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5672423] [2025-02-06 00:54:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:54:23,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:54:23,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:54:23,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:54:23,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:54:23,787 INFO L87 Difference]: Start difference. First operand 261 states and 386 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:54:28,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:54:32,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:54:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:54:32,107 INFO L93 Difference]: Finished difference Result 369 states and 544 transitions. [2025-02-06 00:54:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:54:32,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-02-06 00:54:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:54:32,197 INFO L225 Difference]: With dead ends: 369 [2025-02-06 00:54:32,197 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 00:54:32,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 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 00:54:32,198 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 117 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:54:32,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 355 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-06 00:54:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 00:54:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-02-06 00:54:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 175 states have internal predecessors, (220), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 00:54:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 384 transitions. [2025-02-06 00:54:32,232 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 384 transitions. Word has length 169 [2025-02-06 00:54:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:54:32,232 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 384 transitions. [2025-02-06 00:54:32,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 00:54:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 384 transitions. [2025-02-06 00:54:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 00:54:32,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:54:32,234 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:54:32,257 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 (6)] Ended with exit code 0 [2025-02-06 00:54:32,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 00:54:32,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:54:32,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:54:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash 911082225, now seen corresponding path program 1 times [2025-02-06 00:54:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:54:32,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056985868] [2025-02-06 00:54:32,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:54:32,436 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 00:54:32,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:54:32,437 INFO L229 MonitoredProcess]: Starting monitored process 7 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 00:54:32,438 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 (7)] Waiting until timeout for monitored process [2025-02-06 00:54:32,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 00:54:33,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 00:54:33,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:54:33,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:54:33,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 00:54:33,552 INFO L279 TraceCheckSpWp]: Computing forward predicates...