./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_fillercode_fillercodesize_normal_file-99.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 161552e69a9bd0ec05ff7f0f4aaccea71da982f7d66d3f542fee93bf628b2e7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:14:18,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:14:18,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:14:18,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:14:18,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:14:18,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:14:18,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:14:18,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:14:18,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:14:18,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:14:18,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:14:18,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:14:18,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:14:18,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:14:18,206 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:14:18,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:14:18,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:14:18,206 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:14:18,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:14:18,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:14:18,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:18,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:18,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:18,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:18,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:14:18,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:18,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:18,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:18,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:18,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:14:18,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:14:18,209 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:14:18,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:14:18,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:14:18,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:14:18,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:14:18,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:14:18,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:14:18,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:14:18,209 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 -> 161552e69a9bd0ec05ff7f0f4aaccea71da982f7d66d3f542fee93bf628b2e7a [2025-01-09 09:14:18,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:14:18,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:14:18,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:14:18,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:14:18,437 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:14:18,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-99.i [2025-01-09 09:14:19,635 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba656c4dd/ee963ee6955840cb9ca267f0b9ac3e0e/FLAGeed602b59 [2025-01-09 09:14:19,894 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:14:19,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-99.i [2025-01-09 09:14:19,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba656c4dd/ee963ee6955840cb9ca267f0b9ac3e0e/FLAGeed602b59 [2025-01-09 09:14:19,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba656c4dd/ee963ee6955840cb9ca267f0b9ac3e0e [2025-01-09 09:14:19,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:14:19,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:14:19,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:19,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:14:19,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:14:19,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:19" (1/1) ... [2025-01-09 09:14:19,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f0a043b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:19, skipping insertion in model container [2025-01-09 09:14:19,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:19" (1/1) ... [2025-01-09 09:14:19,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:14:20,062 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_fillercode_fillercodesize_normal_file-99.i[913,926] [2025-01-09 09:14:20,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:20,135 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:14:20,143 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_fillercode_fillercodesize_normal_file-99.i[913,926] [2025-01-09 09:14:20,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:20,193 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:14:20,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20 WrapperNode [2025-01-09 09:14:20,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:20,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:20,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:14:20,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:14:20,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,242 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-01-09 09:14:20,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:20,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:14:20,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:14:20,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:14:20,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,279 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-01-09 09:14:20,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:14:20,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:14:20,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:14:20,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:14:20,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (1/1) ... [2025-01-09 09:14:20,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:20,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:20,332 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-01-09 09:14:20,334 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-01-09 09:14:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:14:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:14:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:14:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:14:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:14:20,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:14:20,415 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:14:20,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:14:20,699 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:14:20,699 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:14:20,707 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:14:20,707 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:14:20,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:20 BoogieIcfgContainer [2025-01-09 09:14:20,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:14:20,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:14:20,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:14:20,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:14:20,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:14:19" (1/3) ... [2025-01-09 09:14:20,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc1a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:20, skipping insertion in model container [2025-01-09 09:14:20,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:20" (2/3) ... [2025-01-09 09:14:20,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc1a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:20, skipping insertion in model container [2025-01-09 09:14:20,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:20" (3/3) ... [2025-01-09 09:14:20,715 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-99.i [2025-01-09 09:14:20,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:14:20,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-99.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:14:20,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:14:20,778 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;@b64ab48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:14:20,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:14:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 09:14:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 09:14:20,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:20,793 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:14:20,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:20,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1915852451, now seen corresponding path program 1 times [2025-01-09 09:14:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64538935] [2025-01-09 09:14:20,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:20,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:14:20,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:14:20,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:20,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-01-09 09:14:21,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:21,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64538935] [2025-01-09 09:14:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64538935] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:14:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047013547] [2025-01-09 09:14:21,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:21,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:14:21,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:21,062 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-01-09 09:14:21,063 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-01-09 09:14:21,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:14:21,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:14:21,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:21,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:21,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:14:21,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-01-09 09:14:21,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:14:21,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047013547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:21,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:14:21,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:14:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851701804] [2025-01-09 09:14:21,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:21,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:14:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:21,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:14:21,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:14:21,280 INFO L87 Difference]: Start difference. First operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 09:14:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:21,304 INFO L93 Difference]: Finished difference Result 168 states and 290 transitions. [2025-01-09 09:14:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:14:21,306 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2025-01-09 09:14:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:21,311 INFO L225 Difference]: With dead ends: 168 [2025-01-09 09:14:21,312 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 09:14:21,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 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-01-09 09:14:21,318 INFO L435 NwaCegarLoop]: 128 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, 128 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-01-09 09:14:21,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 09:14:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 09:14:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 09:14:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2025-01-09 09:14:21,354 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 183 [2025-01-09 09:14:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:21,354 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2025-01-09 09:14:21,354 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, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 09:14:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2025-01-09 09:14:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 09:14:21,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:21,356 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:14:21,363 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-01-09 09:14:21,557 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-01-09 09:14:21,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1517113245, now seen corresponding path program 1 times [2025-01-09 09:14:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715852368] [2025-01-09 09:14:21,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:21,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:21,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:14:21,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:14:21,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:21,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 141 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2025-01-09 09:14:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:14:22,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715852368] [2025-01-09 09:14:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715852368] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:14:22,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684470049] [2025-01-09 09:14:22,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:22,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:14:22,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:22,641 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-01-09 09:14:22,642 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-01-09 09:14:22,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:14:22,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:14:22,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:22,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:22,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 09:14:22,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2025-01-09 09:14:23,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:14:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-01-09 09:14:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684470049] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:14:24,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:14:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-01-09 09:14:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169022434] [2025-01-09 09:14:24,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:14:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 09:14:24,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:14:24,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 09:14:24,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:14:24,031 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-01-09 09:14:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:24,855 INFO L93 Difference]: Finished difference Result 363 states and 528 transitions. [2025-01-09 09:14:24,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 09:14:24,856 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 183 [2025-01-09 09:14:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:24,858 INFO L225 Difference]: With dead ends: 363 [2025-01-09 09:14:24,858 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 09:14:24,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 09:14:24,861 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 486 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:24,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 476 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:14:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 09:14:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 94. [2025-01-09 09:14:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 09:14:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-01-09 09:14:24,892 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 183 [2025-01-09 09:14:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:24,893 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-01-09 09:14:24,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-01-09 09:14:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-01-09 09:14:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 09:14:24,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:24,897 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:14:24,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:14:25,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:14:25,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:25,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash 505995995, now seen corresponding path program 1 times [2025-01-09 09:14:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:14:25,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464029932] [2025-01-09 09:14:25,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:14:25,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:14:25,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:14:25,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:25,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:14:25,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679581760] [2025-01-09 09:14:25,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:25,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:14:25,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:25,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:14:25,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:14:25,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:14:25,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:14:25,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:25,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:14:25,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:14:25,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:14:25,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:14:25,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:25,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:14:25,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:14:25,384 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:14:25,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:14:25,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 09:14:25,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:14:25,589 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 09:14:25,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:14:25,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:14:25 BoogieIcfgContainer [2025-01-09 09:14:25,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:14:25,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:14:25,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:14:25,692 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:14:25,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:20" (3/4) ... [2025-01-09 09:14:25,694 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:14:25,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:14:25,695 INFO L158 Benchmark]: Toolchain (without parser) took 5769.80ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 114.1MB in the beginning and 341.3MB in the end (delta: -227.1MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2025-01-09 09:14:25,695 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:14:25,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.24ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 99.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:14:25,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.89ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 95.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:14:25,697 INFO L158 Benchmark]: Boogie Preprocessor took 51.57ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.1MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:14:25,697 INFO L158 Benchmark]: RCFGBuilder took 404.18ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 66.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:14:25,697 INFO L158 Benchmark]: TraceAbstraction took 4980.94ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 65.6MB in the beginning and 341.4MB in the end (delta: -275.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:14:25,698 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 402.7MB. Free memory was 341.4MB in the beginning and 341.3MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:14:25,699 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.24ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 99.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.89ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 95.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.57ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.1MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 404.18ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 66.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4980.94ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 65.6MB in the beginning and 341.4MB in the end (delta: -275.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 402.7MB. Free memory was 341.4MB in the beginning and 341.3MB in the end (delta: 78.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 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 138. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] signed long int var_1_6 = 25; [L28] double var_1_10 = 99999999999.25; [L29] double var_1_11 = 255.25; [L30] double var_1_12 = 1.125; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 32; [L34] unsigned char var_1_16 = 4; [L35] unsigned char var_1_17 = 2; [L36] signed char var_1_18 = 4; [L37] signed char var_1_19 = 16; [L38] signed char var_1_20 = 32; [L39] signed char var_1_21 = 25; [L40] signed char var_1_22 = 1; [L41] signed char var_1_23 = 100; [L42] double var_1_24 = 3.125; [L43] double var_1_25 = 0.0; [L44] unsigned short int var_1_26 = 32; [L45] unsigned short int var_1_27 = 36217; [L46] unsigned char var_1_28 = 2; VAL [isInitial=0, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L142] isInitial = 1 [L143] FCALL initially() [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L94] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L94] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L97] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L97] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L98] var_1_5 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L100] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L100] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L101] var_1_11 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L102] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L103] var_1_12 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L104] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L107] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L107] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L108] var_1_16 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L109] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L110] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L110] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L111] var_1_17 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L112] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L113] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L113] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L114] var_1_19 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L115] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L116] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L116] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L117] var_1_20 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L118] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L119] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L119] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L121] RET assume_abort_if_not(var_1_21 >= -63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L122] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L122] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L123] var_1_22 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L124] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L125] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L125] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L126] var_1_23 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L127] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L128] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L128] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L129] var_1_25 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L130] RET assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L131] var_1_27 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_27 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L132] RET assume_abort_if_not(var_1_27 >= 32767) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L133] CALL assume_abort_if_not(var_1_27 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L133] RET assume_abort_if_not(var_1_27 <= 65534) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L146] RET updateVariables() [L147] CALL step() [L50] COND TRUE \read(var_1_2) [L51] var_1_1 = (var_1_3 || var_1_4) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=32, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L55] COND TRUE ! var_1_5 [L56] var_1_15 = (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L58] var_1_18 = ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23)))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L59] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L62] var_1_28 = var_1_16 [L63] var_1_6 = ((var_1_28 - var_1_26) + var_1_26) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1] [L64] COND FALSE !(var_1_26 < (var_1_6 * var_1_28)) [L71] var_1_10 = var_1_12 VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=2, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1] [L73] signed long int stepLocal_0 = - var_1_26; VAL [isInitial=1, stepLocal_0=-32, var_1_10=2, var_1_12=2, var_1_13=2, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1] [L74] COND TRUE var_1_12 != var_1_10 [L75] var_1_13 = var_1_14 VAL [isInitial=1, stepLocal_0=-32, var_1_10=2, var_1_12=2, var_1_13=-255, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1] [L83] signed char stepLocal_1 = var_1_23; VAL [isInitial=1, stepLocal_0=-32, stepLocal_1=0, var_1_10=2, var_1_12=2, var_1_13=-255, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1] [L84] EXPR var_1_20 ^ var_1_28 VAL [isInitial=1, stepLocal_0=-32, stepLocal_1=0, var_1_10=2, var_1_12=2, var_1_13=-255, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1] [L84] COND FALSE !(stepLocal_1 >= (var_1_20 ^ var_1_28)) [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=-255, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1] [L138-L139] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1)) && (var_1_1 ? (var_1_26 == ((unsigned short int) ((((((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) < ((var_1_27 - var_1_17))) ? (((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) : ((var_1_27 - var_1_17)))))) : 1)) && (var_1_28 == ((unsigned char) var_1_16)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=-255, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=-255, var_1_14=-255, var_1_15=1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 3, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 604 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 503 IncrementalHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 264 mSDtfsCounter, 503 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 594 GetRequests, 547 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 188 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1098 NumberOfCodeBlocks, 1098 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 910 ConstructedInterpolants, 0 QuantifiedInterpolants, 3211 SizeOfPredicates, 4 NumberOfNonLiveVariables, 812 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 7638/8120 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-01-09 09:14:25,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-99.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 161552e69a9bd0ec05ff7f0f4aaccea71da982f7d66d3f542fee93bf628b2e7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:14:27,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:14:27,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:14:27,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:14:27,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:14:27,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:14:27,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:14:27,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:14:27,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:14:27,698 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:14:27,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:14:27,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:14:27,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:14:27,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:14:27,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:14:27,700 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:27,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:27,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:14:27,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:14:27,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:14:27,702 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:14:27,702 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:14:27,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:14:27,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:14:27,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:14:27,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:14:27,703 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 -> 161552e69a9bd0ec05ff7f0f4aaccea71da982f7d66d3f542fee93bf628b2e7a [2025-01-09 09:14:27,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:14:27,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:14:27,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:14:27,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:14:27,950 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:14:27,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-99.i [2025-01-09 09:14:29,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9ece81ad/fe9a2acde17649d2a253291a0d351846/FLAGe4a4ec1aa [2025-01-09 09:14:29,316 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:14:29,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-99.i [2025-01-09 09:14:29,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9ece81ad/fe9a2acde17649d2a253291a0d351846/FLAGe4a4ec1aa [2025-01-09 09:14:29,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9ece81ad/fe9a2acde17649d2a253291a0d351846 [2025-01-09 09:14:29,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:14:29,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:14:29,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:29,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:14:29,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:14:29,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7a081e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29, skipping insertion in model container [2025-01-09 09:14:29,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:14:29,465 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_fillercode_fillercodesize_normal_file-99.i[913,926] [2025-01-09 09:14:29,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:29,524 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:14:29,532 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_fillercode_fillercodesize_normal_file-99.i[913,926] [2025-01-09 09:14:29,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:14:29,564 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:14:29,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29 WrapperNode [2025-01-09 09:14:29,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:14:29,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:29,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:14:29,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:14:29,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,600 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2025-01-09 09:14:29,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:14:29,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:14:29,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:14:29,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:14:29,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,616 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-01-09 09:14:29,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:14:29,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:14:29,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:14:29,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:14:29,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (1/1) ... [2025-01-09 09:14:29,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:14:29,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:14:29,657 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-01-09 09:14:29,662 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-01-09 09:14:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:14:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:14:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:14:29,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:14:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:14:29,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:14:29,735 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:14:29,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:14:32,533 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 09:14:32,534 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:14:32,540 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:14:32,541 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:14:32,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:32 BoogieIcfgContainer [2025-01-09 09:14:32,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:14:32,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:14:32,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:14:32,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:14:32,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:14:29" (1/3) ... [2025-01-09 09:14:32,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59471ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:32, skipping insertion in model container [2025-01-09 09:14:32,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:14:29" (2/3) ... [2025-01-09 09:14:32,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59471ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:14:32, skipping insertion in model container [2025-01-09 09:14:32,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:14:32" (3/3) ... [2025-01-09 09:14:32,548 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-99.i [2025-01-09 09:14:32,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:14:32,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-99.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:14:32,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:14:32,608 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;@504c4483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:14:32,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:14:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 09:14:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 09:14:32,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:32,624 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:14:32,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:32,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1185040257, now seen corresponding path program 1 times [2025-01-09 09:14:32,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:14:32,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465336964] [2025-01-09 09:14:32,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:32,638 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-01-09 09:14:32,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:14:32,640 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-01-09 09:14:32,641 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-01-09 09:14:32,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 09:14:32,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 09:14:32,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:32,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:32,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:14:32,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-01-09 09:14:33,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:14:33,014 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:14:33,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465336964] [2025-01-09 09:14:33,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465336964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:33,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:33,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:14:33,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360586978] [2025-01-09 09:14:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:33,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:14:33,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:14:33,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:14:33,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:14:33,034 INFO L87 Difference]: Start difference. First operand has 76 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 09:14:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:33,050 INFO L93 Difference]: Finished difference Result 146 states and 254 transitions. [2025-01-09 09:14:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:14:33,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 180 [2025-01-09 09:14:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:33,056 INFO L225 Difference]: With dead ends: 146 [2025-01-09 09:14:33,056 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 09:14:33,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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-01-09 09:14:33,060 INFO L435 NwaCegarLoop]: 110 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, 110 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-01-09 09:14:33,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:14:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 09:14:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-09 09:14:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 09:14:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2025-01-09 09:14:33,097 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 180 [2025-01-09 09:14:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:33,097 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2025-01-09 09:14:33,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 09:14:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2025-01-09 09:14:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 09:14:33,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:33,100 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:14:33,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 09:14:33,302 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-01-09 09:14:33,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:33,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1553481529, now seen corresponding path program 1 times [2025-01-09 09:14:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:14:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937801156] [2025-01-09 09:14:33,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:33,303 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-01-09 09:14:33,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:14:33,307 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-01-09 09:14:33,308 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-01-09 09:14:33,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 09:14:33,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 09:14:33,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:33,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:33,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:14:33,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2025-01-09 09:14:34,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:14:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-01-09 09:14:35,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:14:35,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937801156] [2025-01-09 09:14:35,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937801156] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:14:35,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:14:35,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-01-09 09:14:35,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962543357] [2025-01-09 09:14:35,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:14:35,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 09:14:35,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:14:35,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 09:14:35,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:14:35,444 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-01-09 09:14:37,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:14:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:38,593 INFO L93 Difference]: Finished difference Result 239 states and 344 transitions. [2025-01-09 09:14:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 09:14:38,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 180 [2025-01-09 09:14:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:38,596 INFO L225 Difference]: With dead ends: 239 [2025-01-09 09:14:38,596 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 09:14:38,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 09:14:38,598 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 108 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:38,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 312 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 09:14:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 09:14:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 83. [2025-01-09 09:14:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 09:14:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2025-01-09 09:14:38,616 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 180 [2025-01-09 09:14:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:38,617 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2025-01-09 09:14:38,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-01-09 09:14:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2025-01-09 09:14:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 09:14:38,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:38,619 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:14:38,628 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-01-09 09:14:38,822 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-01-09 09:14:38,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:38,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash -852416951, now seen corresponding path program 1 times [2025-01-09 09:14:38,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:14:38,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850059511] [2025-01-09 09:14:38,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:38,823 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-01-09 09:14:38,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:14:38,825 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-01-09 09:14:38,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 09:14:38,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 09:14:39,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 09:14:39,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:39,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:39,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:14:39,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 760 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2025-01-09 09:14:40,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:14:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 57 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-01-09 09:14:41,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:14:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850059511] [2025-01-09 09:14:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850059511] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:14:41,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 09:14:41,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-09 09:14:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758041782] [2025-01-09 09:14:41,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 09:14:41,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:14:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:14:41,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:14:41,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:14:41,151 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2025-01-09 09:14:44,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:14:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:44,755 INFO L93 Difference]: Finished difference Result 217 states and 292 transitions. [2025-01-09 09:14:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:14:44,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 180 [2025-01-09 09:14:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:44,757 INFO L225 Difference]: With dead ends: 217 [2025-01-09 09:14:44,757 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 09:14:44,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:14:44,759 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 119 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:44,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 259 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 09:14:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 09:14:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2025-01-09 09:14:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.144736842105263) internal successors, (87), 77 states have internal predecessors, (87), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 09:14:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2025-01-09 09:14:44,773 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 180 [2025-01-09 09:14:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2025-01-09 09:14:44,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2025-01-09 09:14:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2025-01-09 09:14:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 09:14:44,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:44,776 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:14:44,787 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-01-09 09:14:44,977 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-01-09 09:14:44,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash -864570962, now seen corresponding path program 1 times [2025-01-09 09:14:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:14:44,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664057081] [2025-01-09 09:14:44,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:44,978 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-01-09 09:14:44,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:14:44,980 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-01-09 09:14:44,980 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-01-09 09:14:45,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:14:45,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:14:45,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:45,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:45,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 09:14:45,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:14:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 09:14:45,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:14:45,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:14:45,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664057081] [2025-01-09 09:14:45,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664057081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:14:45,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:14:45,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:14:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066821740] [2025-01-09 09:14:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:14:45,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:14:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:14:45,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:14:45,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:14:45,667 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 09:14:47,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:14:49,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:14:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:14:49,723 INFO L93 Difference]: Finished difference Result 360 states and 483 transitions. [2025-01-09 09:14:49,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:14:49,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 181 [2025-01-09 09:14:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:14:49,750 INFO L225 Difference]: With dead ends: 360 [2025-01-09 09:14:49,750 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 09:14:49,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 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-01-09 09:14:49,755 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 21 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:14:49,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 301 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 09:14:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 09:14:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2025-01-09 09:14:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 148 states have (on average 1.1418918918918919) internal successors, (169), 150 states have internal predecessors, (169), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 09:14:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 321 transitions. [2025-01-09 09:14:49,796 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 321 transitions. Word has length 181 [2025-01-09 09:14:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:14:49,797 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 321 transitions. [2025-01-09 09:14:49,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 09:14:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 321 transitions. [2025-01-09 09:14:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 09:14:49,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:14:49,800 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:14:49,811 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-01-09 09:14:50,000 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-01-09 09:14:50,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:14:50,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:14:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash 910436400, now seen corresponding path program 1 times [2025-01-09 09:14:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:14:50,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484222026] [2025-01-09 09:14:50,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:14:50,003 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-01-09 09:14:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:14:50,005 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-01-09 09:14:50,008 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-01-09 09:14:50,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:14:50,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:14:50,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:14:50,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:14:50,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 09:14:50,497 INFO L279 TraceCheckSpWp]: Computing forward predicates...