./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:55:22,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:55:22,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:55:22,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:55:22,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:55:22,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:55:22,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:55:22,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:55:22,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:55:22,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:55:22,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:55:22,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:55:22,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:55:22,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:55:22,175 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:55:22,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:55:22,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:55:22,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:55:22,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:55:22,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:55:22,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:55:22,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:55:22,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:55:22,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:55:22,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:55:22,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:55:22,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:55:22,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:55:22,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:55:22,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:55:22,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:55:22,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:55:22,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:55:22,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:55:22,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:55:22,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:55:22,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:55:22,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:55:22,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:55:22,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:55:22,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:55:22,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:55:22,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:55:22,180 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d [2025-02-05 22:55:22,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:55:22,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:55:22,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:55:22,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:55:22,477 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:55:22,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2025-02-05 22:55:23,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0e2b4ed7/5bf67227b1274777b93d907f65b65a2b/FLAGc638f7033 [2025-02-05 22:55:24,061 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:55:24,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2025-02-05 22:55:24,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0e2b4ed7/5bf67227b1274777b93d907f65b65a2b/FLAGc638f7033 [2025-02-05 22:55:24,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0e2b4ed7/5bf67227b1274777b93d907f65b65a2b [2025-02-05 22:55:24,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:55:24,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:55:24,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:55:24,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:55:24,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:55:24,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb4200c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24, skipping insertion in model container [2025-02-05 22:55:24,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:55:24,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2025-02-05 22:55:24,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:55:24,308 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:55:24,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2025-02-05 22:55:24,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:55:24,356 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:55:24,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24 WrapperNode [2025-02-05 22:55:24,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:55:24,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:55:24,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:55:24,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:55:24,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,406 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-02-05 22:55:24,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:55:24,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:55:24,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:55:24,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:55:24,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,451 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:55:24,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:55:24,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:55:24,466 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:55:24,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:55:24,467 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (1/1) ... [2025-02-05 22:55:24,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:55:24,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:24,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:55:24,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:55:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:55:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:55:24,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:55:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:55:24,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:55:24,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:55:24,622 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:55:24,624 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:55:24,996 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 22:55:24,997 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:55:25,010 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:55:25,011 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:55:25,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:55:25 BoogieIcfgContainer [2025-02-05 22:55:25,011 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:55:25,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:55:25,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:55:25,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:55:25,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:55:24" (1/3) ... [2025-02-05 22:55:25,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd55504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:55:25, skipping insertion in model container [2025-02-05 22:55:25,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:24" (2/3) ... [2025-02-05 22:55:25,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd55504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:55:25, skipping insertion in model container [2025-02-05 22:55:25,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:55:25" (3/3) ... [2025-02-05 22:55:25,021 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2025-02-05 22:55:25,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:55:25,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:55:25,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:55:25,110 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;@45eec24d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:55:25,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:55:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 22:55:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 22:55:25,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:25,134 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:25,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:25,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash 18335440, now seen corresponding path program 1 times [2025-02-05 22:55:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:25,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853281992] [2025-02-05 22:55:25,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:25,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 22:55:25,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 22:55:25,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:25,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-02-05 22:55:25,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853281992] [2025-02-05 22:55:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853281992] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384813786] [2025-02-05 22:55:25,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:25,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:25,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:55:25,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:55:25,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 22:55:25,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 22:55:25,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:25,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:25,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:55:25,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-02-05 22:55:25,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:55:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384813786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:25,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:55:25,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:55:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384425657] [2025-02-05 22:55:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:55:25,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:25,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:55:25,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:55:25,859 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 22:55:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:25,884 INFO L93 Difference]: Finished difference Result 170 states and 303 transitions. [2025-02-05 22:55:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:55:25,888 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2025-02-05 22:55:25,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:25,894 INFO L225 Difference]: With dead ends: 170 [2025-02-05 22:55:25,894 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 22:55:25,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:55:25,900 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:25,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:55:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 22:55:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-05 22:55:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 22:55:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2025-02-05 22:55:25,944 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 178 [2025-02-05 22:55:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:25,944 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2025-02-05 22:55:25,945 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 22:55:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2025-02-05 22:55:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 22:55:25,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:25,948 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:25,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:55:26,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:55:26,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:26,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash -336536210, now seen corresponding path program 1 times [2025-02-05 22:55:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:26,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140084671] [2025-02-05 22:55:26,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:26,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 22:55:26,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 22:55:26,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:26,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 22:55:26,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140084671] [2025-02-05 22:55:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140084671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:26,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:55:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018478554] [2025-02-05 22:55:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:26,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:26,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:26,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:26,436 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:26,513 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2025-02-05 22:55:26,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:26,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-02-05 22:55:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:26,516 INFO L225 Difference]: With dead ends: 191 [2025-02-05 22:55:26,516 INFO L226 Difference]: Without dead ends: 109 [2025-02-05 22:55:26,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:26,517 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 32 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:26,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 248 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:55:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-05 22:55:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2025-02-05 22:55:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:55:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2025-02-05 22:55:26,543 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 162 transitions. Word has length 178 [2025-02-05 22:55:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:26,544 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 162 transitions. [2025-02-05 22:55:26,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 162 transitions. [2025-02-05 22:55:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 22:55:26,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:26,547 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:26,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:55:26,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:26,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1127076074, now seen corresponding path program 1 times [2025-02-05 22:55:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745732553] [2025-02-05 22:55:26,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:26,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:26,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:26,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:26,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 22:55:26,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:26,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745732553] [2025-02-05 22:55:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745732553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:26,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:26,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:55:26,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765761422] [2025-02-05 22:55:26,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:26,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:26,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:26,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:26,808 INFO L87 Difference]: Start difference. First operand 106 states and 162 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 22:55:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:26,864 INFO L93 Difference]: Finished difference Result 209 states and 321 transitions. [2025-02-05 22:55:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:26,865 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), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 179 [2025-02-05 22:55:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:26,870 INFO L225 Difference]: With dead ends: 209 [2025-02-05 22:55:26,871 INFO L226 Difference]: Without dead ends: 106 [2025-02-05 22:55:26,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:26,874 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:26,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 120 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:55:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-05 22:55:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-05 22:55:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:55:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 161 transitions. [2025-02-05 22:55:26,897 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 161 transitions. Word has length 179 [2025-02-05 22:55:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:26,898 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 161 transitions. [2025-02-05 22:55:26,899 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), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 22:55:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 161 transitions. [2025-02-05 22:55:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 22:55:26,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:26,905 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:26,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:55:26,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:26,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1323589579, now seen corresponding path program 1 times [2025-02-05 22:55:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:26,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184025804] [2025-02-05 22:55:26,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:26,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:26,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:26,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:26,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 22:55:27,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184025804] [2025-02-05 22:55:27,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184025804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:27,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:27,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:55:27,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998489320] [2025-02-05 22:55:27,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:27,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:27,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:27,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:27,272 INFO L87 Difference]: Start difference. First operand 106 states and 161 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:27,315 INFO L93 Difference]: Finished difference Result 312 states and 477 transitions. [2025-02-05 22:55:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:27,317 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-02-05 22:55:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:27,322 INFO L225 Difference]: With dead ends: 312 [2025-02-05 22:55:27,322 INFO L226 Difference]: Without dead ends: 209 [2025-02-05 22:55:27,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:55:27,324 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 72 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:27,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 255 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:55:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-05 22:55:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-02-05 22:55:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 142 states have (on average 1.380281690140845) internal successors, (196), 144 states have internal predecessors, (196), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:55:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 316 transitions. [2025-02-05 22:55:27,374 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 316 transitions. Word has length 179 [2025-02-05 22:55:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:27,375 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 316 transitions. [2025-02-05 22:55:27,376 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 316 transitions. [2025-02-05 22:55:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 22:55:27,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:27,380 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:27,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:55:27,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:27,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 419220756, now seen corresponding path program 1 times [2025-02-05 22:55:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952432045] [2025-02-05 22:55:27,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:27,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:27,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:27,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:27,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-02-05 22:55:27,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:55:27,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952432045] [2025-02-05 22:55:27,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952432045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:27,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388428249] [2025-02-05 22:55:27,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:27,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:27,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:27,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:55:27,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:55:27,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:27,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:27,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:27,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:27,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 22:55:27,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2025-02-05 22:55:28,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:55:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-02-05 22:55:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388428249] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:55:28,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:55:28,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-05 22:55:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452475470] [2025-02-05 22:55:28,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:55:28,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:55:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:55:28,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:55:28,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:55:28,729 INFO L87 Difference]: Start difference. First operand 207 states and 316 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2025-02-05 22:55:29,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:29,108 INFO L93 Difference]: Finished difference Result 427 states and 643 transitions. [2025-02-05 22:55:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:55:29,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) Word has length 179 [2025-02-05 22:55:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:29,112 INFO L225 Difference]: With dead ends: 427 [2025-02-05 22:55:29,112 INFO L226 Difference]: Without dead ends: 223 [2025-02-05 22:55:29,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:55:29,114 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 156 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:29,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 343 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:55:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-05 22:55:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 215. [2025-02-05 22:55:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 148 states have (on average 1.3513513513513513) internal successors, (200), 150 states have internal predecessors, (200), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:55:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 320 transitions. [2025-02-05 22:55:29,152 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 320 transitions. Word has length 179 [2025-02-05 22:55:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:29,153 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 320 transitions. [2025-02-05 22:55:29,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2025-02-05 22:55:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 320 transitions. [2025-02-05 22:55:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 22:55:29,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:29,156 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:29,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:55:29,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:29,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:29,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1392921896, now seen corresponding path program 1 times [2025-02-05 22:55:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:55:29,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366909350] [2025-02-05 22:55:29,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:55:29,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 22:55:29,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 22:55:29,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:29,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:55:29,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496160554] [2025-02-05 22:55:29,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:29,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:29,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:29,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:55:29,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:55:29,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 22:55:29,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 22:55:29,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:29,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:55:29,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:55:29,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 22:55:29,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 22:55:29,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:29,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:55:29,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:55:29,941 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:55:29,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:55:29,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 22:55:30,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:55:30,147 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-05 22:55:30,295 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:55:30,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:55:30 BoogieIcfgContainer [2025-02-05 22:55:30,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:55:30,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:55:30,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:55:30,301 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:55:30,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:55:25" (3/4) ... [2025-02-05 22:55:30,304 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:55:30,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:55:30,305 INFO L158 Benchmark]: Toolchain (without parser) took 6212.57ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 105.7MB in the beginning and 116.2MB in the end (delta: -10.5MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. [2025-02-05 22:55:30,306 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:55:30,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.46ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:55:30,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.28ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:55:30,307 INFO L158 Benchmark]: Boogie Preprocessor took 57.53ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 85.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:55:30,308 INFO L158 Benchmark]: IcfgBuilder took 545.52ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 62.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 22:55:30,308 INFO L158 Benchmark]: TraceAbstraction took 5286.84ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 61.2MB in the beginning and 116.2MB in the end (delta: -55.0MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. [2025-02-05 22:55:30,309 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 327.2MB. Free memory was 116.2MB in the beginning and 116.2MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:55:30,310 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.27ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.46ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.28ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.53ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 85.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 545.52ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 62.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5286.84ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 61.2MB in the beginning and 116.2MB in the end (delta: -55.0MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 327.2MB. Free memory was 116.2MB in the beginning and 116.2MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 176, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticFLOAToperation at line 103, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L44] double var_1_29 = 15.86; [L45] signed short int var_1_31 = 10; [L46] float var_1_39 = 4.7; [L47] unsigned short int var_1_40 = 100; [L48] signed short int var_1_41 = 4; [L49] float var_1_45 = 31.6; [L50] unsigned short int var_1_47 = 64; [L51] double var_1_48 = 16.75; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L138] var_1_6 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L141] var_1_7 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L144] var_1_9 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L145] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L146] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L146] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L147] var_1_10 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L148] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L149] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L149] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L150] var_1_12 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L151] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L152] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L152] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L153] var_1_13 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L154] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L155] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L155] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L156] var_1_14 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L157] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L158] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L158] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L159] var_1_15 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L160] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L161] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L161] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L162] var_1_16 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L164] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L164] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L165] var_1_17 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L166] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L167] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L167] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L168] var_1_19 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L169] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L170] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L170] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L171] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L171] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L172] var_1_22 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L173] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L174] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L174] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L175] var_1_24 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L176] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L177] var_1_25 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L178] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L179] var_1_26 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L180] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L193] RET updateVariables() [L194] CALL step() [L55] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L56] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L57] COND TRUE var_1_10 <= var_1_17 [L58] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L63] COND FALSE !(var_1_25 < var_1_25) [L68] var_1_39 = 15.6f VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L70] var_1_47 = var_1_17 VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L71] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L72] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L74] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L79] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L80] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16195, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L84] var_1_40 = var_1_15 VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16195, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L85] COND TRUE \read(var_1_7) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16195, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L86] COND TRUE \read(var_1_7) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16195, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L87] COND FALSE !(10000000 <= var_1_16) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16195, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L102] COND TRUE var_1_7 || var_1_6 [L103] var_1_45 = (10.125f + var_1_24) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16195, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L105] COND FALSE !(\read(var_1_18)) [L108] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16195, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L110] COND TRUE var_1_1 && var_1_7 [L111] var_1_31 = ((((((((var_1_17 - var_1_15)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_17 - var_1_15)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) < 0 ) ? -(((((var_1_17 - var_1_15)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_17 - var_1_15)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) : (((((var_1_17 - var_1_15)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_17 - var_1_15)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))))) VAL [isInitial=1, var_1_10=124, var_1_11=1, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16195, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=126, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L121] COND TRUE \read(var_1_1) [L122] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=124, var_1_11=126, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16195, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=126, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=126, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L134] var_1_29 = var_1_24 [L135] var_1_48 = var_1_25 VAL [isInitial=1, var_1_10=124, var_1_11=126, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16195, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=126, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=126, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L194] RET step() [L195] CALL, EXPR property() [L185-L186] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=124, var_1_11=126, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16195, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=126, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=126, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=124, var_1_11=126, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16195, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=126, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=126, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] [L19] reach_error() VAL [isInitial=1, var_1_10=124, var_1_11=126, var_1_12=63, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=63, var_1_17=126, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16195, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=126, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=126, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 1100 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 611 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1610 NumberOfCodeBlocks, 1610 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1421 ConstructedInterpolants, 0 QuantifiedInterpolants, 2127 SizeOfPredicates, 3 NumberOfNonLiveVariables, 831 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 12006/12096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 22:55:30,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:55:32,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:55:32,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:55:32,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:55:32,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:55:33,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:55:33,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:55:33,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:55:33,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:55:33,006 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:55:33,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:55:33,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:55:33,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:55:33,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:55:33,008 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:55:33,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:55:33,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:55:33,009 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:55:33,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:55:33,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:55:33,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:55:33,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:55:33,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:55:33,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:55:33,010 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:55:33,010 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:55:33,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:55:33,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:55:33,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:55:33,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:55:33,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:55:33,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:55:33,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:55:33,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:55:33,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:55:33,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:55:33,013 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d [2025-02-05 22:55:33,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:55:33,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:55:33,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:55:33,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:55:33,366 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:55:33,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2025-02-05 22:55:34,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fca05c78b/6d1d8cf4122d4360bffa0ec6444b90bc/FLAGa05751bf2 [2025-02-05 22:55:34,930 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:55:34,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2025-02-05 22:55:34,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fca05c78b/6d1d8cf4122d4360bffa0ec6444b90bc/FLAGa05751bf2 [2025-02-05 22:55:35,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fca05c78b/6d1d8cf4122d4360bffa0ec6444b90bc [2025-02-05 22:55:35,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:55:35,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:55:35,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:55:35,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:55:35,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:55:35,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3097fd4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35, skipping insertion in model container [2025-02-05 22:55:35,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:55:35,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2025-02-05 22:55:35,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:55:35,495 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:55:35,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2025-02-05 22:55:35,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:55:35,550 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:55:35,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35 WrapperNode [2025-02-05 22:55:35,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:55:35,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:55:35,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:55:35,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:55:35,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,610 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2025-02-05 22:55:35,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:55:35,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:55:35,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:55:35,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:55:35,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,641 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:55:35,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,650 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:55:35,658 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:55:35,658 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:55:35,658 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:55:35,659 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (1/1) ... [2025-02-05 22:55:35,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:55:35,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:55:35,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:55:35,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:55:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:55:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:55:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:55:35,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:55:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:55:35,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:55:35,833 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:55:35,835 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:55:37,991 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 22:55:37,991 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:55:38,001 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:55:38,003 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:55:38,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:55:38 BoogieIcfgContainer [2025-02-05 22:55:38,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:55:38,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:55:38,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:55:38,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:55:38,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:55:35" (1/3) ... [2025-02-05 22:55:38,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4115376e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:55:38, skipping insertion in model container [2025-02-05 22:55:38,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:55:35" (2/3) ... [2025-02-05 22:55:38,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4115376e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:55:38, skipping insertion in model container [2025-02-05 22:55:38,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:55:38" (3/3) ... [2025-02-05 22:55:38,015 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2025-02-05 22:55:38,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:55:38,029 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:55:38,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:55:38,093 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;@7024ab88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:55:38,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:55:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 22:55:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 22:55:38,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:38,111 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:38,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:38,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1118443568, now seen corresponding path program 1 times [2025-02-05 22:55:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:55:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851344319] [2025-02-05 22:55:38,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:38,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:55:38,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:55:38,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:55:38,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 22:55:38,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 22:55:38,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 22:55:38,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:38,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:38,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:55:38,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-02-05 22:55:38,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:55:38,648 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:55:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851344319] [2025-02-05 22:55:38,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851344319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:38,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:55:38,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:55:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323365761] [2025-02-05 22:55:38,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:38,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:55:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:55:38,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:55:38,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:55:38,684 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 22:55:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:38,723 INFO L93 Difference]: Finished difference Result 163 states and 291 transitions. [2025-02-05 22:55:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:55:38,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2025-02-05 22:55:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:38,737 INFO L225 Difference]: With dead ends: 163 [2025-02-05 22:55:38,737 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 22:55:38,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:55:38,745 INFO L435 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:38,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:55:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 22:55:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-05 22:55:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 22:55:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2025-02-05 22:55:38,804 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 178 [2025-02-05 22:55:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:38,805 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2025-02-05 22:55:38,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 22:55:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2025-02-05 22:55:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 22:55:38,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:38,809 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:38,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 22:55:39,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:55:39,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1473315218, now seen corresponding path program 1 times [2025-02-05 22:55:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:55:39,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017313275] [2025-02-05 22:55:39,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:39,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:55:39,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:55:39,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:55:39,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 22:55:39,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 22:55:39,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 22:55:39,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:39,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:39,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:55:39,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-02-05 22:55:39,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:55:39,885 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:55:39,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017313275] [2025-02-05 22:55:39,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017313275] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:39,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [709157113] [2025-02-05 22:55:39,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:39,887 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:55:39,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:55:39,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:55:39,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-05 22:55:40,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 22:55:40,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 22:55:40,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:40,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:40,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:55:40,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 22:55:40,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:55:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [709157113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:40,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:55:40,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 22:55:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229515219] [2025-02-05 22:55:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:40,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:40,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:55:40,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:40,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:40,454 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:42,676 INFO L93 Difference]: Finished difference Result 183 states and 282 transitions. [2025-02-05 22:55:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:42,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-02-05 22:55:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:42,697 INFO L225 Difference]: With dead ends: 183 [2025-02-05 22:55:42,697 INFO L226 Difference]: Without dead ends: 105 [2025-02-05 22:55:42,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:42,699 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 34 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:42,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 219 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 22:55:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-05 22:55:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2025-02-05 22:55:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 70 states have internal predecessors, (95), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 22:55:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-02-05 22:55:42,719 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 178 [2025-02-05 22:55:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:42,720 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-02-05 22:55:42,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-02-05 22:55:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 22:55:42,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:42,723 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:42,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 22:55:42,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-02-05 22:55:43,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 22:55:43,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:43,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2010702012, now seen corresponding path program 1 times [2025-02-05 22:55:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:55:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71056849] [2025-02-05 22:55:43,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:43,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:55:43,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:55:43,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:55:43,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 22:55:43,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:43,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:43,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:43,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:43,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:55:43,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-02-05 22:55:43,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:55:43,796 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:55:43,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71056849] [2025-02-05 22:55:43,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71056849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:43,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [129092060] [2025-02-05 22:55:43,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:43,797 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:55:43,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:55:43,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:55:43,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-05 22:55:43,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:44,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:44,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:44,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:44,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:55:44,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 22:55:44,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:55:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [129092060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:44,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:55:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 22:55:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865838228] [2025-02-05 22:55:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:44,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:55:44,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:44,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:44,318 INFO L87 Difference]: Start difference. First operand 102 states and 155 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:45,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:55:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:46,566 INFO L93 Difference]: Finished difference Result 208 states and 312 transitions. [2025-02-05 22:55:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:46,567 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-02-05 22:55:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:46,570 INFO L225 Difference]: With dead ends: 208 [2025-02-05 22:55:46,570 INFO L226 Difference]: Without dead ends: 109 [2025-02-05 22:55:46,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:46,572 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 31 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:46,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 240 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 22:55:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-05 22:55:46,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2025-02-05 22:55:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 22:55:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2025-02-05 22:55:46,587 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 179 [2025-02-05 22:55:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:46,588 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2025-02-05 22:55:46,588 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2025-02-05 22:55:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 22:55:46,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:46,591 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:46,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-02-05 22:55:46,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 22:55:46,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:55:46,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:46,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2090966837, now seen corresponding path program 1 times [2025-02-05 22:55:46,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:55:46,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015930653] [2025-02-05 22:55:46,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:55:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:55:46,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:55:46,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-05 22:55:47,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:47,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:47,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:47,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:47,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:55:47,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-02-05 22:55:47,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:55:47,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:55:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015930653] [2025-02-05 22:55:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015930653] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [62447494] [2025-02-05 22:55:47,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:47,534 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:55:47,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:55:47,537 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:55:47,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-05 22:55:47,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:47,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:47,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:47,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:47,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:55:47,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 22:55:48,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:55:48,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [62447494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:48,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:55:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 22:55:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164163404] [2025-02-05 22:55:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:48,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:55:48,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:48,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:48,640 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:49,673 INFO L93 Difference]: Finished difference Result 273 states and 411 transitions. [2025-02-05 22:55:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:49,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-02-05 22:55:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:49,700 INFO L225 Difference]: With dead ends: 273 [2025-02-05 22:55:49,700 INFO L226 Difference]: Without dead ends: 183 [2025-02-05 22:55:49,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:49,701 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 33 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:49,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 241 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 22:55:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-05 22:55:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-02-05 22:55:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 120 states have internal predecessors, (160), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 22:55:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 272 transitions. [2025-02-05 22:55:49,738 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 272 transitions. Word has length 179 [2025-02-05 22:55:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:49,739 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 272 transitions. [2025-02-05 22:55:49,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 272 transitions. [2025-02-05 22:55:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 22:55:49,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:49,741 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:49,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-05 22:55:49,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-02-05 22:55:50,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 22:55:50,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:50,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash -461190124, now seen corresponding path program 1 times [2025-02-05 22:55:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:55:50,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308666478] [2025-02-05 22:55:50,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:50,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:55:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:55:50,146 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:55:50,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-05 22:55:50,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:50,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:50,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:50,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:50,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:55:50,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-02-05 22:55:50,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:55:50,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:55:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308666478] [2025-02-05 22:55:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308666478] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1791534057] [2025-02-05 22:55:50,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:50,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:55:50,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:55:50,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:55:50,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-02-05 22:55:51,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:51,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:51,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:51,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:52,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:55:52,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 22:55:52,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:55:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1791534057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:52,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:55:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 22:55:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243310003] [2025-02-05 22:55:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:52,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:55:52,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:52,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:52,134 INFO L87 Difference]: Start difference. First operand 181 states and 272 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:55:54,867 INFO L93 Difference]: Finished difference Result 535 states and 806 transitions. [2025-02-05 22:55:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:55:54,868 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-02-05 22:55:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:55:54,873 INFO L225 Difference]: With dead ends: 535 [2025-02-05 22:55:54,873 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 22:55:54,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:55:54,877 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 114 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:55:54,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 320 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 22:55:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 22:55:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2025-02-05 22:55:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 234 states have internal predecessors, (306), 112 states have call successors, (112), 8 states have call predecessors, (112), 8 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 22:55:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 530 transitions. [2025-02-05 22:55:54,930 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 530 transitions. Word has length 179 [2025-02-05 22:55:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:55:54,931 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 530 transitions. [2025-02-05 22:55:54,932 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 22:55:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 530 transitions. [2025-02-05 22:55:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 22:55:54,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:55:54,934 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:55:54,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-05 22:55:55,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-02-05 22:55:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 22:55:55,335 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:55:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:55:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -966748749, now seen corresponding path program 1 times [2025-02-05 22:55:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:55:55,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999870278] [2025-02-05 22:55:55,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:55,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:55:55,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:55:55,339 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:55:55,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-05 22:55:55,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:55,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:55,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:55,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:55,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:55:55,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-02-05 22:55:55,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:55:56,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:55:56,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999870278] [2025-02-05 22:55:56,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999870278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:55:56,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [822286074] [2025-02-05 22:55:56,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:55:56,029 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:55:56,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:55:56,032 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:55:56,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-02-05 22:55:56,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 22:55:57,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 22:55:57,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:55:57,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:55:57,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:55:57,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-02-05 22:55:57,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:55:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-02-05 22:55:58,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [822286074] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:55:58,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:55:58,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-02-05 22:55:58,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114089746] [2025-02-05 22:55:58,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:55:58,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:55:58,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:55:58,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:55:58,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:55:58,208 INFO L87 Difference]: Start difference. First operand 355 states and 530 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-02-05 22:56:07,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:56:08,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:56:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:56:13,164 INFO L93 Difference]: Finished difference Result 967 states and 1399 transitions. [2025-02-05 22:56:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 22:56:13,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 179 [2025-02-05 22:56:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:56:13,173 INFO L225 Difference]: With dead ends: 967 [2025-02-05 22:56:13,173 INFO L226 Difference]: Without dead ends: 615 [2025-02-05 22:56:13,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2025-02-05 22:56:13,185 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 485 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:56:13,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 470 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2025-02-05 22:56:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-02-05 22:56:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 395. [2025-02-05 22:56:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 266 states have (on average 1.263157894736842) internal successors, (336), 266 states have internal predecessors, (336), 112 states have call successors, (112), 16 states have call predecessors, (112), 16 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 22:56:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 560 transitions. [2025-02-05 22:56:13,241 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 560 transitions. Word has length 179 [2025-02-05 22:56:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:56:13,241 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 560 transitions. [2025-02-05 22:56:13,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-02-05 22:56:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 560 transitions. [2025-02-05 22:56:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 22:56:13,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:56:13,245 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:56:13,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2025-02-05 22:56:13,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-05 22:56:13,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:56:13,646 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:56:13,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:56:13,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1410066547, now seen corresponding path program 1 times [2025-02-05 22:56:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:56:13,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703289806] [2025-02-05 22:56:13,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:56:13,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:56:13,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:56:13,650 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:56:13,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-05 22:56:13,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 22:56:13,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 22:56:13,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:56:13,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:56:14,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 22:56:14,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:56:29,879 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2025-02-05 22:56:37,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from false [2025-02-05 22:56:41,759 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true