./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adaf57c8caca25e02285c35c5809f03c64bacca23d89893e8459b2d8fe50621e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:13:27,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:13:27,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:13:27,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:13:27,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:13:27,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:13:27,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:13:27,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:13:27,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:13:27,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:13:27,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:13:27,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:13:27,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:13:27,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:13:27,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:13:27,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:13:27,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:13:27,934 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adaf57c8caca25e02285c35c5809f03c64bacca23d89893e8459b2d8fe50621e [2025-03-08 10:13:28,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:13:28,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:13:28,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:13:28,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:13:28,169 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:13:28,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i [2025-03-08 10:13:29,230 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4834ef02/cfc37d7a068a4bd6ae388c87390d89b9/FLAG82c65ca82 [2025-03-08 10:13:29,484 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:13:29,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i [2025-03-08 10:13:29,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4834ef02/cfc37d7a068a4bd6ae388c87390d89b9/FLAG82c65ca82 [2025-03-08 10:13:29,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4834ef02/cfc37d7a068a4bd6ae388c87390d89b9 [2025-03-08 10:13:29,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:13:29,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:13:29,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:13:29,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:13:29,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:13:29,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:29" (1/1) ... [2025-03-08 10:13:29,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:29, skipping insertion in model container [2025-03-08 10:13:29,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:29" (1/1) ... [2025-03-08 10:13:29,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:13:29,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i[917,930] [2025-03-08 10:13:29,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:13:29,967 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:13:29,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i[917,930] [2025-03-08 10:13:30,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:13:30,018 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:13:30,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30 WrapperNode [2025-03-08 10:13:30,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:13:30,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:13:30,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:13:30,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:13:30,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,053 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2025-03-08 10:13:30,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:13:30,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:13:30,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:13:30,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:13:30,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,089 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:13:30,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:13:30,106 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:13:30,106 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:13:30,106 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:13:30,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (1/1) ... [2025-03-08 10:13:30,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:13:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:13:30,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:13:30,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:13:30,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:13:30,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:13:30,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:13:30,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:13:30,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:13:30,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:13:30,222 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:13:30,224 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:13:30,451 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L145: havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-08 10:13:30,480 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 10:13:30,480 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:13:30,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:13:30,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:13:30,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:30 BoogieIcfgContainer [2025-03-08 10:13:30,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:13:30,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:13:30,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:13:30,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:13:30,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:13:29" (1/3) ... [2025-03-08 10:13:30,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258732c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:30, skipping insertion in model container [2025-03-08 10:13:30,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:30" (2/3) ... [2025-03-08 10:13:30,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258732c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:30, skipping insertion in model container [2025-03-08 10:13:30,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:30" (3/3) ... [2025-03-08 10:13:30,500 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-43.i [2025-03-08 10:13:30,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:13:30,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-43.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:13:30,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:13:30,550 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;@16105c17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:13:30,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:13:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 54 states have internal predecessors, (71), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:13:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:13:30,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:30,565 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:30,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1933302329, now seen corresponding path program 1 times [2025-03-08 10:13:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:13:30,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588730744] [2025-03-08 10:13:30,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:13:30,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:13:30,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:13:30,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:30,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 10:13:30,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:13:30,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588730744] [2025-03-08 10:13:30,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588730744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:13:30,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950715499] [2025-03-08 10:13:30,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:30,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:13:30,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:13:30,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:13:30,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:13:30,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:13:31,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:13:31,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:31,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:31,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:13:31,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:13:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 10:13:31,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:13:31,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950715499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:13:31,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:13:31,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:13:31,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513241136] [2025-03-08 10:13:31,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:13:31,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:13:31,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:13:31,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:13:31,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:13:31,097 INFO L87 Difference]: Start difference. First operand has 89 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 54 states have internal predecessors, (71), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:13:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:13:31,127 INFO L93 Difference]: Finished difference Result 172 states and 302 transitions. [2025-03-08 10:13:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:13:31,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-08 10:13:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:13:31,134 INFO L225 Difference]: With dead ends: 172 [2025-03-08 10:13:31,135 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 10:13:31,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:13:31,143 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:13:31,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:13:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 10:13:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 10:13:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:13:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2025-03-08 10:13:31,183 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 204 [2025-03-08 10:13:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:13:31,185 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2025-03-08 10:13:31,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:13:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2025-03-08 10:13:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:13:31,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:31,188 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:31,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:13:31,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:13:31,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:31,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash 726395878, now seen corresponding path program 1 times [2025-03-08 10:13:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:13:31,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138776449] [2025-03-08 10:13:31,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:13:31,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:13:31,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:13:31,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:31,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:13:31,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:13:31,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138776449] [2025-03-08 10:13:31,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138776449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:13:31,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:13:31,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:13:31,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671323923] [2025-03-08 10:13:31,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:13:31,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:13:31,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:13:31,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:13:31,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:13:31,681 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:13:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:13:31,713 INFO L93 Difference]: Finished difference Result 170 states and 263 transitions. [2025-03-08 10:13:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:13:31,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:13:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:13:31,715 INFO L225 Difference]: With dead ends: 170 [2025-03-08 10:13:31,715 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 10:13:31,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:13:31,717 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:13:31,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:13:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 10:13:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 10:13:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:13:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2025-03-08 10:13:31,725 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 204 [2025-03-08 10:13:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:13:31,727 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2025-03-08 10:13:31,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:13:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2025-03-08 10:13:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:13:31,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:31,731 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:31,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:13:31,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:31,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash 432992871, now seen corresponding path program 1 times [2025-03-08 10:13:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:13:31,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331195617] [2025-03-08 10:13:31,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:13:31,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:13:31,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:13:31,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:31,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:13:31,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:13:31,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:13:31,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:13:31,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:31,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:13:32,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:13:32,034 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:13:32,034 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:13:32,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:13:32,037 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 10:13:32,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:13:32,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:13:32 BoogieIcfgContainer [2025-03-08 10:13:32,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:13:32,149 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:13:32,149 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:13:32,149 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:13:32,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:30" (3/4) ... [2025-03-08 10:13:32,151 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:13:32,151 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:13:32,152 INFO L158 Benchmark]: Toolchain (without parser) took 2354.89ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 154.4MB in the end (delta: -417.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:32,152 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:32,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.41ms. Allocated memory is still 201.3MB. Free memory was 153.6MB in the beginning and 139.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:13:32,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.61ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 136.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:32,152 INFO L158 Benchmark]: Boogie Preprocessor took 51.99ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 133.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:32,152 INFO L158 Benchmark]: IcfgBuilder took 386.87ms. Allocated memory is still 201.3MB. Free memory was 133.9MB in the beginning and 110.9MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:13:32,153 INFO L158 Benchmark]: TraceAbstraction took 1653.76ms. Allocated memory is still 201.3MB. Free memory was 110.0MB in the beginning and 155.7MB in the end (delta: -45.7MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2025-03-08 10:13:32,153 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 201.3MB. Free memory was 155.7MB in the beginning and 154.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:13:32,154 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.18ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.41ms. Allocated memory is still 201.3MB. Free memory was 153.6MB in the beginning and 139.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.61ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 136.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.99ms. Allocated memory is still 201.3MB. Free memory was 136.9MB in the beginning and 133.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 386.87ms. Allocated memory is still 201.3MB. Free memory was 133.9MB in the beginning and 110.9MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1653.76ms. Allocated memory is still 201.3MB. Free memory was 110.0MB in the beginning and 155.7MB in the end (delta: -45.7MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 201.3MB. Free memory was 155.7MB in the beginning and 154.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed long int var_1_8 = -1; [L30] signed long int var_1_9 = 50; [L31] signed char var_1_10 = 64; [L32] signed short int var_1_11 = 5; [L33] unsigned short int var_1_12 = 4; [L34] unsigned char var_1_13 = 1; [L35] unsigned short int var_1_14 = 49632; [L36] unsigned short int var_1_15 = 0; [L37] signed char var_1_16 = 50; [L38] float var_1_17 = 128.5; [L39] signed char var_1_18 = 2; [L40] signed char var_1_19 = 25; [L41] signed char var_1_20 = 10; [L42] signed char var_1_21 = 1; [L43] signed char var_1_22 = 8; [L44] unsigned long int var_1_23 = 25; [L45] unsigned short int var_1_24 = 32; [L46] unsigned long int var_1_25 = 16; [L47] signed long int var_1_26 = 50; VAL [isInitial=0, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_2=10227/40, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L149] isInitial = 1 [L150] FCALL initially() [L151] COND TRUE 1 [L152] FCALL updateLastVariables() [L153] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L90] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L91] var_1_3 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L92] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L93] var_1_4 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L94] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L95] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L95] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L96] var_1_5 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L97] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L98] var_1_6 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L99] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L100] var_1_8 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L101] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L102] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L102] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L103] var_1_9 = __VERIFIER_nondet_long() [L104] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L106] var_1_10 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L109] var_1_13 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L114] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L115] var_1_15 = __VERIFIER_nondet_ushort() [L116] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L118] var_1_17 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L119] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L120] var_1_18 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L122] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L123] var_1_19 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L125] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L126] var_1_20 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L128] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L128] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L129] var_1_21 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L130] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L131] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L132] var_1_22 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L134] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L134] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L135] var_1_24 = __VERIFIER_nondet_ushort() [L136] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L136] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L137] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L138] var_1_25 = __VERIFIER_nondet_ulong() [L139] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=5003/5, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L153] RET updateVariables() [L154] CALL step() [L51] COND TRUE (- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4)) [L52] var_1_1 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L56] EXPR var_1_8 & var_1_9 VAL [isInitial=1, var_1_10=1, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L56] COND FALSE !(-4 > (var_1_8 & var_1_9)) [L59] COND TRUE var_1_1 > var_1_4 [L60] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L64] COND TRUE \read(var_1_13) [L65] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L67] signed char stepLocal_0 = var_1_19; VAL [isInitial=1, stepLocal_0=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L68] COND TRUE var_1_2 <= (((((var_1_3) < (var_1_17)) ? (var_1_3) : (var_1_17))) + var_1_1) [L69] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, stepLocal_0=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=0, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L77] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L78] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, stepLocal_0=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=0, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L82] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, stepLocal_0=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=0, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L154] RET step() [L155] CALL, EXPR property() [L145] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_8 & var_1_9)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=0, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L145-L146] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_8 & var_1_9)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((var_1_7) < (((16 - 32) + (64 + var_1_10)))) ? (var_1_7) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_2 <= (((((var_1_3) < (var_1_17)) ? (var_1_3) : (var_1_17))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_25)) ? (var_1_14) : (var_1_25))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < var_1_9) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L155] RET, EXPR property() [L155] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=0, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=0, var_1_18=-1, var_1_19=1, var_1_1=49637, var_1_20=1, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 170 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 383 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 259 mSDtfsCounter, 12 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 816 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 443 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 6272/6336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:13:32,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adaf57c8caca25e02285c35c5809f03c64bacca23d89893e8459b2d8fe50621e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:13:33,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:13:34,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:13:34,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:13:34,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:13:34,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:13:34,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:13:34,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:13:34,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:13:34,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:13:34,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:13:34,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:13:34,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:13:34,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:13:34,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:13:34,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:13:34,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:13:34,049 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:13:34,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:13:34,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:13:34,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:13:34,051 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adaf57c8caca25e02285c35c5809f03c64bacca23d89893e8459b2d8fe50621e [2025-03-08 10:13:34,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:13:34,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:13:34,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:13:34,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:13:34,284 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:13:34,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i [2025-03-08 10:13:35,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ec761b6/e6a90153648a47ffa13f26db0ac391b8/FLAG16767fdd9 [2025-03-08 10:13:35,685 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:13:35,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i [2025-03-08 10:13:35,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ec761b6/e6a90153648a47ffa13f26db0ac391b8/FLAG16767fdd9 [2025-03-08 10:13:35,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ec761b6/e6a90153648a47ffa13f26db0ac391b8 [2025-03-08 10:13:35,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:13:35,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:13:35,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:13:35,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:13:35,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:13:35,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:35,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6396e6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35, skipping insertion in model container [2025-03-08 10:13:35,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:35,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:13:35,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i[917,930] [2025-03-08 10:13:35,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:13:35,913 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:13:35,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i[917,930] [2025-03-08 10:13:35,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:13:35,964 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:13:35,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35 WrapperNode [2025-03-08 10:13:35,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:13:35,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:13:35,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:13:35,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:13:35,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:35,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:35,996 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2025-03-08 10:13:35,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:13:35,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:13:35,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:13:35,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:13:36,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,017 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:13:36,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:13:36,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:13:36,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:13:36,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:13:36,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (1/1) ... [2025-03-08 10:13:36,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:13:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:13:36,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:13:36,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:13:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:13:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:13:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:13:36,078 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:13:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:13:36,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:13:36,142 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:13:36,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:13:48,441 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 10:13:48,441 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:13:48,452 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:13:48,453 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:13:48,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:48 BoogieIcfgContainer [2025-03-08 10:13:48,453 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:13:48,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:13:48,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:13:48,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:13:48,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:13:35" (1/3) ... [2025-03-08 10:13:48,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a35bd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:48, skipping insertion in model container [2025-03-08 10:13:48,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:35" (2/3) ... [2025-03-08 10:13:48,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a35bd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:48, skipping insertion in model container [2025-03-08 10:13:48,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:48" (3/3) ... [2025-03-08 10:13:48,462 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-43.i [2025-03-08 10:13:48,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:13:48,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-43.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:13:48,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:13:48,528 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;@20eeab7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:13:48,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:13:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:13:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 10:13:48,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:48,540 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:48,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:48,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:48,544 INFO L85 PathProgramCache]: Analyzing trace with hash -780799940, now seen corresponding path program 1 times [2025-03-08 10:13:48,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:13:48,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587680223] [2025-03-08 10:13:48,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:48,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:13:48,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:13:48,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:13:48,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:13:48,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 10:13:49,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 10:13:49,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:49,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:49,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:13:49,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:13:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2025-03-08 10:13:49,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:13:49,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:13:49,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587680223] [2025-03-08 10:13:49,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587680223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:13:49,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:13:49,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:13:49,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090837547] [2025-03-08 10:13:49,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:13:49,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:13:49,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:13:49,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:13:49,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:13:49,096 INFO L87 Difference]: Start difference. First operand has 80 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:13:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:13:49,114 INFO L93 Difference]: Finished difference Result 154 states and 274 transitions. [2025-03-08 10:13:49,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:13:49,115 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2025-03-08 10:13:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:13:49,119 INFO L225 Difference]: With dead ends: 154 [2025-03-08 10:13:49,119 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 10:13:49,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:13:49,123 INFO L435 NwaCegarLoop]: 118 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, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:13:49,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:13:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 10:13:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-08 10:13:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:13:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2025-03-08 10:13:49,154 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 201 [2025-03-08 10:13:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:13:49,155 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2025-03-08 10:13:49,155 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:13:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2025-03-08 10:13:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 10:13:49,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:13:49,157 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:13:49,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 10:13:49,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:13:49,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:13:49,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:13:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1405482621, now seen corresponding path program 1 times [2025-03-08 10:13:49,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:13:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423275411] [2025-03-08 10:13:49,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:13:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:13:49,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:13:49,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:13:49,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:13:49,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 10:13:49,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 10:13:49,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:13:49,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:13:49,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 10:13:49,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:14:13,636 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:14:33,200 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2025-03-08 10:14:49,915 WARN L286 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:14:59,586 WARN L286 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)